Efficient experimental string matching by weak factor recognition

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

Volumn 2089, Issue , 2001, Pages 51-72

  Allauzen, Cyril ^a   Crochemore, Maxime ^a   Raffinot, Mathieu ^b  

^a Université de Marne la Vallée   (France)

^b LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

Algorithm design; Finite automaton; Information retrieval; String matching

Indexed keywords

FINITE AUTOMATA; INFORMATION RETRIEVAL; PATTERN MATCHING; ROBOTS;

ALGORITHM DESIGN; FACTOR ORACLE; OPTIMALITY; SEQUENTIAL CONSTRUCTION; STRING MATCHING;

STRING SEARCHING ALGORITHMS;

EID: 84957029585     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48194-x_5     Document Type: Conference Paper

References (11)

1. C. Allauzen. Combinatoire sur les mots et recherche de motifs (Combinatorics on words and string matching). PhD thesis, Universitfie de Marne-la-Vallfiee, 2001.
2. C. Allauzen, M. Crochemore, and M. Rafinot. Factor oracle: a new structure for pattern matching. In Miroslav Bartosek Jan Pavelka, Gerard Tel, editor, SOF-SEM'99, Theory and Practice of Informatics (Brno, 1999), number 1725 in LNCS, pages 291-306. Springer-Verlag, 1999.
3. C. Allauzen and M. Rafinot. Factor oracle of a set of words. Technical Report 99-11, Institut Gaspard-Monge, Universitfie de Marne-la-Vallfiee, 1999. http://www-igm.univ-mlv.fr/~raffinot/ftp/IGM99-11-english.ps.gz.
4. R. A. Baeza-Yates. Searching subsequences. Theor. Comput. Sci., 78(2):363-376, 1991.
5. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, M. T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci., 40(1):31-55, 1985.
6. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977.
7. M. Crochemore. Transducers and repetitions. Theor. Comput. Sci., 45(1):63-86, 1986.
8. M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994.
9. A. Czumaj, M. Crochemore, L. Gasieniec, S. Jarominek, T. Lecroq, W. Plandowski, and W. Rytter. Speeding up two string-matching algorithms. Algorithmica, 12:247-267, 1994.
10. D. Sunday. A very fast substring search algorithm. CACM, 33(8):132-142, August 1990.
11. A. C. Yao. The complexity of pattern matching for a random string. SIAM J. Comput., 8(3):368-387, 1979.