Long Common Subsequences and the Proximity of Two Random Strings
- 1 August 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 42 (4) , 731-737
- https://doi.org/10.1137/0142051
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The Jackknife Estimate of VarianceThe Annals of Statistics, 1981
- Some limit results for longest common subsequencesDiscrete Mathematics, 1979
- 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
- Postulates for Subadditive ProcessesThe Annals of Probability, 1974
- Subadditive Ergodic TheoryThe Annals of Probability, 1973
- A test for nucleotide sequence homologyJournal of Molecular Biology, 1973
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972