Approximate String Matching With Dynamic Programming and Suffix Trees (original) (raw)
Related papers
A Comparison of Approximate String Matching Algorithms
Software: Practice and Experience, 1996
A NEW STRING MATCHING ALGORITHM
2000
Approximate string matching using compressed suffix arrays
Theoretical Computer Science, 2006
A Survey of String Matching Algorithms
Suffix vector: space- and time-efficient alternative to suffix trees
Australian Computer Science Communications, 2002
A unified view to string matching algorithms
Lecture Notes in Computer Science, 1996
Handbook of exact string matching algorithms
2004
Indexed Hierarchical Approximate String Matching
Lecture Notes in Computer Science, 2009
Algorithm Engineering for All-Pairs Suffix-Prefix Matching
2017
Modified Suffix Search Algorithm for Multiple String Matching
2013
A FAST STRING MATCHING ALGORITHM
The exact string matching problem: a comprehensive experimental evaluation
2010
A Fast Suffix Automata Based Algorithm for Exact Online String Matching
Implementation and Application of Automata, 2012
Fast Algorithms for Exact String Matching
2015
A Fast Heuristic for Exact String Matching
ArXiv, 2015
Fast and practical approximate string matching
Information Processing Letters, 1996
Suffix Tree of Alignment: An Efficient Index for Similar Data
Lecture Notes in Computer Science, 2013
The exact string matching algorithms efficiency review
Science Park Research Organization & Counselling
Fast approximate string matching
Software: Practice and Experience, 1988
An Improved Algorithm for Approximate String Matching
Speeding up two string-matching algorithms
Wojciech Plandowski, Wojciech Rytter
Algorithmica, 1994
A Comparison of Different Algorithms for Approximate String Matching
International Journal of Recent Research Aspects ISSN 2349-7688
Approximate string matching: indexing and the k-mismatch problem
2004
A unifying look at the apostolico-giancarlo string-matching algorithm
2003
Dynamic dictionary matching and compressed suffix trees
2005
Approximate String Matching with Compressed Indexes
Algorithms, 2009
A Partition-Based Suffix Tree Construction and Its Applications
Greedy Algorithms, 2008
Practical and Optimal String Matching
2005
Augmenting Suffix Trees, with Applications
1998
A comparison of the performance of four exact string matching algorithms
2007 IEEE International Conference on Electro/Information Technology, 2007
String Matching Algorithms With emphasis on Tries
Faster Approximate String Matching
Algorithmica, 1999
A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees
Algorithmica, 2003