An efficient algorithm for generating Super Condensed Neighborhoods

Lecture Notes in Computer Science

Volumn 3537, Issue , 2005, Pages 104-115

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

^a INESC ID   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; PATTERN MATCHING; PROBLEM SOLVING;

APPROXIMATE STRING MATCHING PROBLEM; INCREASED BIT-PARALLELISM TECHNIQUE; PATTERN NEIGHBORHOOD; SUPER CONDENSED NEIGHBORHOODS;

ALGORITHMS;

EID: 26444574213     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496656_10     Document Type: Conference Paper

References (17)

1. R. Baeza-Yates. Text retrieval: Theory and practice, volume I, pages 465-476. 12th IFIP World Computer Congress, Elsevier Science, 1992.
2. R. Baeza-Yates and G. Gonnet. A new approach to text searching. Communications of the ACM, (35(10)):74-82, 1992.
3. A.L. Cobbs. Fast approximate matching using suffix trees. In Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching (CPM95), LNCS 937, pages 41-54. Springer, 1995.
4. Dan Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1999.
5. H. Hyyrö. Explaining and extending the bit-parallel approximate string matching algorithm of myers. Technical Report A-2001-10, Dept. of Computer and Information Sciences, University of Tampere, Tampere, Finland, 2001.
6. H. Hyyrö. Practical Methods for Approximate String Matching. PhD thesis, University of Tampere, 2003.
7. H. Hyyrö, K. Fredriksson, and G. Navarro. Increased bit-parallelism for approximate string matching. In Proc. 3rd Workshop on Efficient and Experimental Algorithms (WEA '04), LNCS 3059, pages 285-298, 2004.
8. 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.
9. 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.
10. E. Myers. A sublinear algorithm for approximate keyword matching. Algorithmica, (12):345-374, 1994.
11. G. Myers. A fast bit-vector algorithm for approximate pattern matching based on dynamic programming. In Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching (CPM98), LNCS 1448, pages 1-13. Springer-Verlag, 1998.
12. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
13. G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms, 1(1):205-239, 2000.
14. 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.
15. E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, pages 132-137, 1985.
16. E. Ukkonen. Approximate string matching over suffix trees, volume 684 of LNCS 2857, pages 228-242. Procedings of the 4th Annual Symposium on Combinatorical Pattern Matching (CPM93), Springer, 1993.
17. S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, (35(10)):83-91, 1992.