The functionality of a gene or a protein depends on codon repeats occurring in it.As a consequence of their vitality in protein function and apparent involvement in causing diseases,an interest in these repeats has de...The functionality of a gene or a protein depends on codon repeats occurring in it.As a consequence of their vitality in protein function and apparent involvement in causing diseases,an interest in these repeats has developed in recent years.The analysis of genomic and proteomic sequences to identify such repeats requires some algorithmic support from informatics level.Here,we proposed an offline stand-alone toolkit Repeat Searcher and Motif Detector（RSMD）,which uncovers and employs few novel approaches in identification of sequence repeats and motifs to understand their functionality in sequence level and their disease causing tendency.The tool offers various features such as identifying motifs,repeats and identification of disease causing repeats.RSMD was designed to provide an easily understandable graphical user interface（GUI）,for the tool will be predominantly accessed by biologists and various researchers in all platforms of life science.GUI was developed using the scripting language Perl and its graphical module PerlTK.RSMD covers algorithmic foundations of computational biology by combining theory with practice.展开更多
In this paper we try to introduce a new approach to operational semantics of recursive programs by using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu of modelling partial func...In this paper we try to introduce a new approach to operational semantics of recursive programs by using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu of modelling partial functions by introducing undefined values in a traditional approach,we shall define a priority derivation tree for every term,and by respecting the rule“attacking the subterm of the highest priority first”we define transition relations,computation sequences etc.directly based on a standard interpretation which includes no undefined value in its domain.Finally,we prove that our new approach generates the same operational semantics as the traditional one.It is also pointed out that we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semantics of recursive programs cannot be built based on predicate logic.展开更多
文摘The functionality of a gene or a protein depends on codon repeats occurring in it.As a consequence of their vitality in protein function and apparent involvement in causing diseases,an interest in these repeats has developed in recent years.The analysis of genomic and proteomic sequences to identify such repeats requires some algorithmic support from informatics level.Here,we proposed an offline stand-alone toolkit Repeat Searcher and Motif Detector（RSMD）,which uncovers and employs few novel approaches in identification of sequence repeats and motifs to understand their functionality in sequence level and their disease causing tendency.The tool offers various features such as identifying motifs,repeats and identification of disease causing repeats.RSMD was designed to provide an easily understandable graphical user interface（GUI）,for the tool will be predominantly accessed by biologists and various researchers in all platforms of life science.GUI was developed using the scripting language Perl and its graphical module PerlTK.RSMD covers algorithmic foundations of computational biology by combining theory with practice.
文摘In this paper we try to introduce a new approach to operational semantics of recursive programs by using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu of modelling partial functions by introducing undefined values in a traditional approach,we shall define a priority derivation tree for every term,and by respecting the rule“attacking the subterm of the highest priority first”we define transition relations,computation sequences etc.directly based on a standard interpretation which includes no undefined value in its domain.Finally,we prove that our new approach generates the same operational semantics as the traditional one.It is also pointed out that we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semantics of recursive programs cannot be built based on predicate logic.
