On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- 1 October 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (5) , 1122-1139
- https://doi.org/10.1137/s009753979223842x
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- The Rate of Convergence of the Mean Length of the Longest Common SubsequenceThe Annals of Applied Probability, 1994
- Linear approximation of shortest superstringsJournal of the ACM, 1994
- An Introduction to Kolmogorov Complexity and Its ApplicationsPublished by Springer Nature ,1993
- Theory and algorithms for plan mergingArtificial Intelligence, 1992
- HANDLING FEATURE INTERACTIONS IN PROCESS-PLANNINGApplied Artificial Intelligence, 1992
- Two algorithms for the longest common subsequence of three (or more) stringsPublished by Springer Nature ,1992
- Kolmogorov Complexity and its ApplicationsPublished by Elsevier ,1990
- Computing a longest common subsequence for a set of stringsBIT Numerical Mathematics, 1984
- Longest common subsequences of two random sequencesJournal of Applied Probability, 1975
- Computer Analysis of Protein EvolutionScientific American, 1969