A guided tour to approximate string matching (2001)

Cached

Download Links

by Gonzalo Navarro
Venue:ACM Computing Surveys
Citations:404 - 38 self

Active Bibliography

Approximate Text Searching – Gonzalo Navarro Badino - 1998
From nondeterministic suffix automaton to lazy suffix tree – Kimmo Fredriksson
52 Faster Algorithms for String Matching with k Mismatches – Amihood Amir, Moshe Lewenstein, Ely Porat - 2000
27 Tries for Approximate String Matching – H. Shang, T.H. Merrett - 1996
17 Suffix Trees and their Applications in String Algorithms – Roberto Grossi, Giuseppe F. Italiano - 1993
8 Efficient String Algorithmics – Dany Breslauer - 1992
Succinct Backward-DAWG-Matching – KIMMO FREDRIKSSON
Practical Amortized Dynamic Indexing – Amihood Amir, Noa Lewenstein, Alejandro A. Schäffer
27 Pattern Matching And Text Compression Algorithms – Maxime Crochemore, Thierry Lecroq
3 q-gram Matching Using Tree Models – Prahlad Fogla, Wenke Lee - 2005
COMPRESSED PATTERN MATCHING FOR TEXT AND IMAGES – Tao Tao - 2005
37 NR-grep: A Fast and Flexible Pattern Matching Tool – Gonzalo Navarro - 2000
1 Text Searching: Theory and Practice – Ricardo A. Baeza-yates, Gonzalo Navarro
1 String Alignment in Grammatical Inference - what suffix trees can do – Jeroen Geertzen - 2003
1 Average-Optimal String Matching – Kimmo Fredriksson , Szymon Grabowski - 2009
6 Multidimensional Pattern Matching: A Survey – Amihood Amir - 1992
Spring ’12 Scribe Notes Collection – Prof Erik Demaine, Ta Tom Morgan, Justin Zhang, Editing Justin, Zhang Contents
3 Pattern Matching in Strings – Maxime Crochemore, Christophe Hancart - 1998
4 SEQUENCE-BASED PROTEIN FUNCTION PREDICTION – Brett Poulin - 2004