Indexed hierarchical approximate string matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5280 LNCS, Issue , 2008, Pages 144-154

  Russo, Luís M S ^a,c   Navarro, Gonzalo ^b   Oliveira, Arlindo L ^a,d  

^a INESC ID   (Portugal)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^d INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; INFORMATION RETRIEVAL; ENTROPY;

APPROXIMATE STRING MATCHING; BIDIRECTIONALITY; COMPRESSED SUFFIX TREES; COMPUTATIONAL BIOLOGY; HIERARCHICAL VERIFICATION; SEARCH PROCEDURES; SUFFIX-TREES; WELL-ESTABLISHED TECHNIQUES;

TREES (MATHEMATICS);

EID: 85041127484     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89097-3_15     Document Type: Conference Paper

References (20)

1. Myers, E.W.: A sublinear algorithm for approximate keyword searching, Algorithmica 12(4/5), 345-374 (1994)
2. Navarro, G., Baeza-Yates, R.: A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms 1(1), 205-239 (2000)
3. Navarro, G., Sutinen, E., Tarhio, J.: Indexing text with approximate q-grams. J. Discrete Algorithms 3(2-4), 157-175 (2005)
4. Kurtz, S.: Reducing the space requirement of suffix trees. Softw., Pract. Exper. 29(13), 1149-1171 (1999)
5. Navarro, G., Makinen, V.: Compressed full-text indexes. ACM Comp. Surv. 39(1) article 2 (2007)
6. Russo, L.M.S., Navarro, G., Oliveira, A.L.: Approximate string matching with Lempel-Ziv compressed indexes. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 264-275. Springer, Heidelberg (2007)
7. Russo, L., Navarro, G., Oliveira, A.: Fully-Compressed Suffix Trees. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 362-373. Springer, Heidelberg (2008)
8. Navarro, G., Baeza-Yates, R.: improving an algorithm for approximate pattern matching. Algorithmica 30(4), 473-502 (2001)
9. Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. S1AM J. Comput. 27(2), 557-582 (1998)
10. Russo, L.M.S., Oliveira, A.L.: A compressed self-index using a Ziv-Lempel dictionary. in: 13th SPIRE. LNCS, vol. 4029, pp. 163-180. Springer, Heidelberg (2006)
11. Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997)
12. Ferragina, P., Manzini, G.: indexing compressed text. Journal of the ACM 52(4), 552-581 (2005)
13. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. J. of Algorithms 48(2), 294-313 (2003)
14. Weiner, P.: Linear pattern matching algorithms. In: IEEE Symp. on Switching and Automata Theory, pp. 1-11 (1973)
15. Ukkonen, E.: Finding approximate patterns in strings. Journal of Algorithms, 132-137 (1985)
16. Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM 46(3), 395-415 (1999)
17. Navarro, G., Baeza-Yates, R.: Very fast and simple approximate string matching, information Processing Letters 72, 65-70 (1999)
18. Navarro, G.: Indexing text using the Ziv-Lempel trie. J. Discrete Algorithms 2(1), 87-114 (2004)
19. Morales, P.: Solving complex queries over a compressed text index. Undergraduate thesis, Dept. Comp. Sci., Univ. Chile (2005) Spanish. G. Navarro, advisor
20. Wu, S., Manber, U.: Fast text searching allowing errors. Commun. ACM 35(10), 83-91 (1992)