文章基本信息

标题：Matching Sequences under Deletion/Insertion Constraints
本地全文：下载
作者：David Sankoff
期刊名称：Proceedings of the National Academy of Sciences
印刷版ISSN：0027-8424
电子版ISSN：1091-6490
出版年度：1972
卷号：69
期号：1
页码：4-6
DOI：10.1073/pnas.69.1.4
语种：English
出版社：The National Academy of Sciences of the United States of America
摘要：Given two finite sequences, we wish to find the longest common subsequences satisfying certain deletion/insertion constraints. Consider two successive terms in the desired subsequence. The distance between their positions must be the same in the two original sequences for all but a limited number of such pairs of successive terms. Needleman and Wunsch gave an algorithm for finding longest common subsequences without constraints. This is improved from the viewpoint of computational economy. An economical algorithm is then elaborated for finding subsequences satisfying deletion/insertion constraints. This result is useful in the study of genetic homology based on nucleotide or amino-acid sequences.
关键词：algorithm ; genetic homology ; nucleotide sequence ; amino-acid sequence