Serial Computations of Levenshtein Distances (1997)

Cached

Download Links

by Dan Hirschberg
Citations:14 - 0 self

Active Bibliography

15 String Editing and Longest Common Subsequences – Alberto Apostolico - 1996
7 Sequence Comparison: Some Theory and Some Practice – Imre Simon - 1988
1 Efficient Algorithms for Sequence Analysis – David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano - 1991
4 Efficient Algorithms for Sequence Analysis with Concave and Convex Gap Costs – David A. Eppstein - 1989
2 A New Practical Linear Space Algorithm for the Longest Common Subsequence Problem – H. Goeman, M. Clausen
19 Expected Length of Longest Common Subsequences – Vladimír Dancík
29 Longest Common Subsequences – Mike Paterson, Vlado Dancik - 1994
5 Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms – Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon - 2003
9 Measuring the Accuracy of Page-Reading Systems – Stephen V. Rice - 1996
8 Bit-Parallel LCS-length Computation Revisited – Heikki Hyyrö - 2004
4 Longest common subsequence problem for unoriented and – François Nicolas, Eric Rivals - 2006
9 Experimenting an Approximation Algorithm for the LCS – Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri - 1998
1 A Specialized Branching and Fathoming Technique for The Longest Common Subsequence Problem – Todd Easton, Abhilash Singireddy - 2006
26 A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence Problem – Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon, James F. Reid - 2000
Contents lists available at SciVerse ScienceDirect – Hsing-yen Ann, Chang-biau Yang, Chiou-ting Tseng, Chiou-yi Hor
1 Efficient Polynomial-Time Algorithms for Variants of the Multiple Constrained LCS Problem – Hsing-yen Ann, Chang-biau Yang, Chiou-ting Tseng
1 String comparison by transposition networks – Peter Krusche, Er Tiskin - 903
unknown title – unknown authors
4 Maximal Common Subsequences and Minimal Common Supersequences – Campbell B. Fraser, Robert W. Irving, Martin Middendorf - 1995