An O(ND) Difference Algorithm and Its Variations (1986)

by Eugene W. Myers
Venue:Algorithmica
Citations:155 - 4 self

Active Bibliography

7 Sequence Comparison: Some Theory and Some Practice – Imre Simon - 1988
29 Longest Common Subsequences – Mike Paterson, Vlado Dancik - 1994
9 Measuring the Accuracy of Page-Reading Systems – Stephen V. Rice - 1996
2 A New Practical Linear Space Algorithm for the Longest Common Subsequence Problem – H. Goeman, M. Clausen
59 A file comparison program – Webb Miller, Eugene, W. Myers - 1985
19 Expected Length of Longest Common Subsequences – Vladimír Dancík
404 A Guided Tour to Approximate String Matching – Gonzalo Navarro - 1999
1 Discrete Pattern Matching Over Sequences And Interval Sets – James Robert Knight - 1993
1 A Specialized Branching and Fathoming Technique for The Longest Common Subsequence Problem – Todd Easton, Abhilash Singireddy - 2006
38 Incremental String Comparison – Gad M. Landau , Eugene W. Myers, Jeanette P. Schmidt - 1995
30 An Empirical Study of Delta Algorithms – James Hunt, Kiem-phong Vo, Walter F. Tichy - 1996
51 Delta Algorithms: An Empirical Analysis – James J. Hunt, Kiem-Phong Vo, Walter F. Tichy - 1998
7 Bit-Parallel LCS-length Computation Revisited – Heikki Hyyrö - 2004
9 On the safety and efficiency of firewall policy deployment – Charles C. Zhang, Marianne Winslett, Carl A. Gunter - 2007
5 Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms – Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon - 2003
The 27th Workshop on Combinatorial Mathematics and Computation Theory Algorithms for the Hybrid Constrained Longest Common Subsequence Problem – Yi-ching Chen
1 Fast Algorithms for Computing Tree LCS – Shay Mozes, Dekel Tsur, Oren Weimann, Michal Ziv-ukelson
Some Lower and Upper Bounds for Tree Edit Distance – Shay Mozes, Oren Weimann, Michal Ziv-ukelson Contents
1 A Scalable and Efficient Systolic Algorithm for the Longest Common Subsequence Problem – Yen-chun Lin, Jih-wei Yeh - 2002