Algorithms for approximate string matching
Information and Control
Data structures and algorithms for approximate string matching
Journal of Complexity
Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Fast parallel and serial approximate string matching
Journal of Algorithms
An improved algorithm for approximate string matching
SIAM Journal on Computing
SIAM Journal on Computing
The String-to-String Correction Problem
Journal of the ACM (JACM)
Approximate Periods of Strings
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Finding All Approximate Gapped Palindromes
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Computing the minimum approximate λ-cover of a string
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Fully incremental LCS computation
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Implementing approximate regularities
Mathematical and Computer Modelling: An International Journal
Landmark-join: hash-join based string similarity joins with edit distance constraints
DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
| Hi-index | 0.00 |
In this paper we consider the incremental/decremental version of the edit distance problem: given a solution to the edit distance between two strings A and B, find a solution to the edit distance between A and B′ where B = aB (incremental) or bB′ = B (decremental). As a solution for the edit distance between A and B, we define the difference representation of the D-table, which leads to a simple and intuitive algorithm for the incremental/decremental edit distance problem.