We introduce two new index structures based on the q-gram index. The new structures index substrings of variable length instead of q-grams of fixed length. For both of the new indexes, we present a method based on the suffix tree to efficiently choose the indexed substrings so that each of them occurs almost equally frequently in the text. Our experiments show that the resulting indexes are up to 40% faster than the q-gram index when they use the same space. © 2009 Springer.
CITATION STYLE
Navarro, G., & Salmela, L. (2009). Indexing variable length substrings for exact and approximate matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5721 LNCS, pp. 214–221). https://doi.org/10.1007/978-3-642-03784-9_21
Mendeley helps you to discover research relevant for your work.