Searching subsequences
- 1 January 1991
- journal article
- research article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 78 (2), 363-376
- https://doi.org/10.1016/0304-3975(91)90358-9
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The longest common subsequence problem revisitedAlgorithmica, 1987
- Calcul de la distance par les sous-motsRAIRO - Theoretical Informatics and Applications, 1986
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Computing a longest common subsequence for a set of stringsBIT Numerical Mathematics, 1984
- The string merging problemBIT Numerical Mathematics, 1981
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- An information-theoretic lower bound for the longest common subsequence problemInformation Processing Letters, 1978
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- PATRICIA—Practical Algorithm To Retrieve Information Coded in AlphanumericJournal of the ACM, 1968