An O(NP) sequence comparison algorithm
- 15 September 1990
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 35 (6), 317-323
- https://doi.org/10.1016/0020-0190(90)90035-v
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Row replacement algorithms for screen editorsACM Transactions on Programming Languages and Systems, 1989
- Shortest paths in euclidean graphsAlgorithmica, 1986
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- A file comparison programSoftware: Practice and Experience, 1985
- A longest common subsequence algorithm suitable for similar text stringsActa Informatica, 1982
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970