Efficient high-similarity string comparison: the waterfall algorithm

Authors:
Alexander Tiskin
Affiliations:
University of Warwick, United Kingdom
Venue:
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Year:
2013

Citing 9
Cited 0

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
A fast bit-vector algorithm for approximate string matching based on dynamic programming

Journal of the ACM (JACM)
Simple and fast linear space computation of longest common subsequences

Information Processing Letters
A fast and practical bit-vector algorithm for the longest common subsequence problem

Information Processing Letters
A Survey of Longest Common Subsequence Algorithms

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
An all-substrings common subsequence algorithm

Discrete Applied Mathematics
Sequence Comparison: Theory and Methods

Sequence Comparison: Theory and Methods
Sorting Networks of Logarithmic Depth, Further Simplified

Algorithmica
Designing Sorting Networks: A New Paradigm

Designing Sorting Networks: A New Paradigm

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper outlines the design of a bit-parallel, multi-string algorithm for high-similarity string comparison. We present it in the framework for the longest common subsequence (LCS) problem developed by the author in [31]. The algorithm is based on a bit-parallel LCS algorithm by Crochemore et al. [14].