Improved algorithms for approximate string matching (extended abstract)
2009
Improved Algorithms for String Matching
publication
Evidence: moderate
Author Information
Author(s): Papamichail Dimitris, Papamichail Georgios
Primary Institution: University of Miami
Hypothesis
Can we design a more efficient algorithm for calculating the edit distance between two strings?
Conclusion
The new algorithm for calculating the edit distance shows improved performance, especially when the lengths of the strings differ significantly.
Supporting Evidence
- The new algorithm improves the theoretical bounds for calculating edit distance.
- It performs well in practice, especially for strings of significantly different lengths.
- The implementation is competitive with the fastest algorithms available.
Takeaway
This study created a new way to compare two strings and find out how different they are, which is useful in many areas like biology and text processing.
Methodology
The algorithm calculates the edit distance in O((s - |n - m|)·min(m, n, s) + m + n) time and linear space.
Limitations
The algorithm's performance may vary based on the specific characteristics of the input strings.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website