Some limit results for longest common subsequences
- 31 December 1979
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 26 (1) , 17-31
- https://doi.org/10.1016/0012-365x(79)90057-8
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The tree-to-tree editing problemInformation Processing Letters, 1977
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNAJournal of Molecular Evolution, 1976
- A Method for the Correction of Garbled Words Based on the Levenshtein MetricIEEE Transactions on Computers, 1976
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- Longest common subsequences of two random sequencesJournal of Applied Probability, 1975
- An algorithm for the distance between two finite sequencesJournal of Combinatorial Theory, Series A, 1974
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Subadditive Ergodic TheoryThe Annals of Probability, 1973