TY - JOUR
T1 - An efficient string matching algorithm with k differences for nudeotide and amino acid sequences
AU - Landau, Gad M.
AU - Vishkin, Uzi
AU - Nussinov, Ruth
PY - 1986/1/10
Y1 - 1986/1/10
N2 - There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, the pattern, of length m, with another, longer sequence the text, of length n These algorithms allow mismatches, deletions and insertions. Algorithms to date run in 0(mn) time. Let us define an integer. k, which is the maximal number of differences allowed We present a simple algorithm showing that sequences can be optimally aligned in O(k2) time. For long sequences the gain factor over the currently used algorithms is very large.
AB - There are a few algorithms designed to solve the problem of the optimal alignment of one sequence, the pattern, of length m, with another, longer sequence the text, of length n These algorithms allow mismatches, deletions and insertions. Algorithms to date run in 0(mn) time. Let us define an integer. k, which is the maximal number of differences allowed We present a simple algorithm showing that sequences can be optimally aligned in O(k2) time. For long sequences the gain factor over the currently used algorithms is very large.
UR - http://www.scopus.com/inward/record.url?scp=0023045756&partnerID=8YFLogxK
U2 - 10.1093/nar/14.1.31
DO - 10.1093/nar/14.1.31
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0023045756
SN - 0305-1048
VL - 14
SP - 31
EP - 46
JO - Nucleic Acids Research
JF - Nucleic Acids Research
IS - 1
ER -