Faster generation of super condensed neighbourhoods using finite automata

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

Volumn 3772 LNCS, Issue , 2005, Pages 246-255

  Russo, Luís M S ^a   Oliveira, Arlindo L ^a  

^a INESC ID   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; FINITE AUTOMATA; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

BIT-PARALLELISM; HYBRID ALGORITHMS; SUPER CONDENSED NEIGHBOURHOODS;

ALGORITHMS;

EID: 33646751474     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_28     Document Type: Conference Paper

References (18)

1. Ricardo A. Baeza-Yates. Text-retrieval: Theory and practice. In Jan van Leeuwen, editor, IFIP Congress (1), volume A-12 of IFIP Transactions, pages 465-476. North-Holland, 1992.
2. Ricardo A. Baeza-Yates and Gaston H. Gonnet. A new approach to text searching. Commun. ACM, 35(10);74-82, 1992.
3. Ricardo A. Baeza-Yates and Gonzalo Navarro. A faster algorithm for approximate string matching. In Daniel S. Hirschberg and Eugene W. Myers, editors, CPM, volume 1075 of Lecture Notes in Computer Science, pages 1-23. Springer, 1996.
4. Ricardo A. Baeza-Yates and Gonzalo Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
5. Archie L. Cobbs. Fast approximate matching using suffix trees. In Zvi Galil and Esko Ukkonen, editors, CPM, volume 937 of Lecture Notes in Computer Science, pages 41-54. Springer, 1995.
6. H. Hyyrö and G. Navarro. A practical index for genome searching. In Proceedings of the 10th International Symposium on String Processing and Information Retrieval (SPIRE 2003), LNCS 2857, pages 341-349. Springer, 2003.
7. Heikki Hyyrö. Practical Methods for Approximate String Matching. PhD thesis, Faculty of Information of the University of Tampere, 2003.
8. Heikki Hyyrö. An improvement and an extension on the hybrid index for approximate string matching. In Proceedings of the 11th International Symposium on String Processing and Information Retrieval (SPIRE 2003), LNCS 3246, pages 208-209. Springer, 2004.
9. E. Myers. A sublinear algorithm for approximate keyword matching. Algorithmica, (12):345-374, 1994.
10. Gene Myers. A fast bit-vector algorithm for approximate string matching based on dynamic programming. In Martin Farach-Colton, editor, CPM, volume 1448 of Lecture Notes in Computer Science, pages 1-13. Springer, 1998.
11. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
12. G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms, 1(1):205-239, 2000.
13. G. Navarro, R. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Engineering Bulletin, 24(4): 19-27, 2001.
14. Luís M. S. Russo and Arlindo L. Oliveira. An efficient algorithm for generating super condensed neighborhoods. In Alberto Apostolico, Maxime Crochemore, and Kunsoo Park, editors, CPM, volume 3537 of Lecture Notes in Computer Science, pages 104-115. Springer, 2005.
15. E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, pages 132-137, 1985.
16. Esko Ukkonen. Approximate string-matching over suffix trees. In Alberto Apostolico, Maxime Crochemore, Zvi Galil, and Udi Manber, editors, CPM, volume 684 of Lecture Notes in Computer Science, pages 228-242. Springer, 1993.
17. Sun Wu and Udi Manber. Fast text searching allowing errors. Commun. ACM, 35(10):83-91, 1992.
18. file 20ng-train-all-terms from http://www.gia.ist.utl.pt/~acardoso/ datasets