A generalized method for matching informational macromolecular code sequences

The major outlines of an exhaustive algorithm which discovers the optimal correspondence of a pair of code strings from a pre-specified alphabet is presented. The measure of the quality of correspondence is the information required to effect the mutations indicated by the correspondence. This formul...

Full description

Saved in:
Bibliographic Details
Published inComputers in biology and medicine Vol. 4; no. 1; pp. 43 - 57
Main Authors Wong, A.K.C., Reichert, T.A., Cohen, D.N., Aygun, B.O.
Format Journal Article
LanguageEnglish
Published United States Elsevier Ltd 01.06.1974
Subjects
Amino Acid Sequence
Animals
Baker's yeast
Base Sequence
Computers
E. coli
Escherichia coli
Information Systems
Macromolecular Substances
Mathematics
Probability
RNA, Transfer
Saccharomyces cerevisiae
Tyrosyl t-RNA
Baker's yeast
Tyrosyl t-RNA
E. coli
Online AccessGet full text

Cover

More Information
Summary:The major outlines of an exhaustive algorithm which discovers the optimal correspondence of a pair of code strings from a pre-specified alphabet is presented. The measure of the quality of correspondence is the information required to effect the mutations indicated by the correspondence. This formulation is shown to lead naturally to expressions for the penalty for introducing gaps, an ad hoc feature of previous approaches. The limitations of earlier algorithms of this type are delineated, and a non-trivial example of the matching of two partial sequences of Tyrosyl t-RNA from E. coli and Baker's yeast is given.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0010-4825
1879-0534
DOI:10.1016/0010-4825(74)90006-7