Finding patterns with variable length gaps or don't cares

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

Volumn 4112 LNCS, Issue , 2006, Pages 146-155

  Rahman, M Sohel ^a,d   Iliopoulos, Costas S ^a   Lee, Inbok ^b   Mohamed, Manal ^a   Smyth, William F ^c  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b Seoul National University   (South Korea)

^c MCMASTER UNIVERSITY   (Canada)

^d BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; DATA STRUCTURES; INFORMATION MANAGEMENT; PROBLEM SOLVING;

COMPONENT SUBPATTERNS; PATTERN MATCHING PROBLEMS; VARIABLE LENGTH GAPS;

PATTERN MATCHING;

EID: 33749554843     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11809678_17     Document Type: Conference Paper

References (18)

1. Aho, A., Corasick, M.: Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18 333-340, 1975.
2. Akutsu, T.: Approximate string matching with variable length don't care characters. IEICE Trans. Information and Systems, E79-D:1353-1354, 1996.
3. Amir, A., Lewenstein, M., Porat E.: Faster algorithms for string matching with fc mismatches. In Proceedings of the Symposium on Discrete Algorithms (SODA 2000), pages 794-803, 2000.
4. Baeza-Yates, R., Gonnet, G.: A new approach to text searching. Communications of the ACM, 35:74-82, 1992.
5. Cole, R., Hariharan, R.: Approximate string matching: a faster simpler algorithm. In Proceedings of the Symposium on Discrete Algorithms (SODA 1998), pages 463-472, 1998.
6. Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In Proceedings of the Symposium on Theory of Computing (STOC 2002), pages 592-601, 2002.
7. Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News, 17(4):52-54, 1986.
8. Fischer, M. J., Paterson, M. S.: String matching and other products. Technical report, Massachusetts Institute of Technology, Cambridge, MA, 1974.
9. Gusfield, D.: Algorithms on strings, trees, and sequences. Cambridge University Press, 1997.
10. Kärkkäinen, J., Sanders, P.: Simple linear work Suffix Array Construction. In Proceedings 30th Internat. Colloq. Automata, Languages and Programming (2003), Lecture Notes in Computer Science, 2719, pages 943-955, 2003.
11. Ko, P., Aluru, S.: Space Efficient Linear Time Construction of Suffix Arrays. In Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium (CPM 2003), Lecture Notes in Computer Science, 2676, pages 200-210, 2003.
12. Kim, D. K., Sim, J. S., Park, H., Park, K.: Linear-Time Construction of Suffix Arrays. In Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium (CPM 2003), Lecture Notes in Computer Science, 2676, pages 186-199, 2003.
13. Landau, G. M., Vishkin, U.: Efficient string matching with fc mismatches. Theoretical Computer Science, 43:239-249, 1986.
14. Landau, G. M., Vishkin, U.: Fast parallel and serial approximate string matching. Journal of Algorithms, 10(2):157-169, 1989.
15. Lee, I., Apostolico, A., Iliopoulos, C. S., Park, K. : Finding approximate occurrence of a pattern that contains gaps. In Proceedings of the 14th Australasian Workshop on Combinatorial Algorithms (AWOCA 2003), pages 89-100, 2003.
16. Navarro, G., Raffinot, M.: Fast and simple character classes and bounded gaps pattern matching. Journal of Computational Biology, 10(6):903-923, 2003.
17. Sahinalp, S. C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In Proceedings of the Symposium on Foundations of Computer Science, pages 320-328, 1996.
18. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6:80-82, 1977.