Paper Info
Title
Efficient high-similarity string comparison: the waterfall algorithm
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].
Year
DOI
Venue
2013
10.1145/2457317.2457384
EDBT/ICDT Workshops
Keywords
Field
DocType
waterfall algorithm,longest common subsequence,high-similarity string comparison,multi-string algorithm,efficient high-similarity string comparison,bit-parallel lcs algorithm,string matching,similarity search,edit distance,string similarity
String searching algorithm,String-to-string correction problem,Commentz-Walter algorithm,Computer science,Wagner–Fischer algorithm,Algorithm,Rabin–Karp algorithm,Approximate string matching,String metric,Boyer–Moore string search algorithm
Conference
Citations 
PageRank 
References 
0
0.34
18
Authors
1
Name
Order
Citations
PageRank
Alexander Tiskin122015.50