Complexity of common subsequence and supersequence problems and related problems
- 1 January 1990
- journal article
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 25 (5) , 565-580
- https://doi.org/10.1007/bf01075212
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- A linear space algorithm for the LCS problemActa Informatica, 1987
- A longest common subsequence algorithm suitable for similar text stringsActa Informatica, 1982
- Combinatorial TheoryPublished by Springer Nature ,1979
- An Extension of the String-to-String Correction ProblemJournal of the ACM, 1975
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974
- A test for nucleotide sequence homologyJournal of Molecular Biology, 1973
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970
- Computer Analysis of Protein EvolutionScientific American, 1969
- Computer aids to protein sequence determinationJournal of Theoretical Biology, 1965