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...
Saved in:
Published in | Computers in biology and medicine Vol. 4; no. 1; pp. 43 - 57 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
United States
Elsevier Ltd
01.06.1974
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!