Incremental String Comparison
From MaRDI portal
Publication:4388886
DOI10.1137/S0097539794264810zbMath0907.68075WikidataQ56813213 ScholiaQ56813213MaRDI QIDQ4388886
Eugene W. Myers, Jeanette P. Schmidt, Gad M. Landau
Publication date: 10 May 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68P99: Theory of data
Related Items
Unnamed Item, Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product, Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity, Unnamed Item, EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS, Approximate periods of strings, Longest common extensions in trees, Monge properties of sequence alignment, Dynamic edit distance table under a general weighted cost function, Pattern matching in pseudo real-time, Longest common subsequence problem for unoriented and cyclic strings, A dynamic edit distance table, Semi-local longest common subsequences in subquadratic time, Overlap matching., Approximate string matching with compressed indexes, On almost Monge all scores matrices, Approximate swapped matching., Speeding up the detection of tandem repeats over the edit distance, Efficient all path score computations on grid graphs, Time-space trade-offs for longest common extensions, Two algorithms for LCS consecutive suffix alignment, Time-Space Trade-Offs for Longest Common Extensions, Longest Common Extensions in Trees, Longest Common Extensions in Sublinear Space, Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance, APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS, FINDING ALL APPROXIMATE GAPPED PALINDROMES, Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions
