Factor oracle: A new structure for pattern matching

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

Volumn 1725, Issue , 1999, Pages 295-310

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

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

Author keywords

Algorithm design; Finite automaton; Indexing; Pattern matching

Indexed keywords

ALGORITHMS; FINITE AUTOMATA; INDEXING (OF INFORMATION); PATTERN MATCHING;

ALGORITHM DESIGN; FACTOR ORACLE;

INFORMATION SCIENCE;

EID: 84957638499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47849-3_18     Document Type: Conference Paper

References (15)

1. C. Allauzen, M. Crochemore, and M. Raffinot. Factor oracle, Suffix oracle. Technical Report 99-08, Institut Gaspard-Monge, Université de Marne-la-Vallee, 1999. http://www-igm.univ-mlv.fr/raffinot/ftp/IGM99-08-english.ps.gz.
2. C. Allauzen and M. Raffinot. Oracle des facteurs d’un ensemble de mots. Rapport technique 99-11, Institut Gaspard Monge, Université de Marne-la-Valleé, 1999. http://www-igm.univ-mlv.fr/raffinot/ftp/IGM99-11.ps.gz.
3. R. A. Baeza-Yates. Searching subsequences. Theor. Comput. Sci., 78(2):363-376, 1991.
4. 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.
5. A. Blumer, A. Ehrenfeucht, and D. Haussler. Average size of suffix trees and DAWGS. Discret. Appl. Math., 24:37-45, 1989.
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, F. Mignosi, and A. Restivo. Automata and forbidden words. Information Processing Letters, 67(3):111-117, 1998.
9. M. Crochemore, F. Mignosi, and A. Restivo. Minimal forbidden words and factor automata. In L. Brim, J. Gruska, and J. Zlatuska, editors, Mathematical Foundations of Computer Science 1998, number 1450 in LNCS, pages 665-673. Springer- Verlag, 1998. Extended abstract of [8].
10. M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi. Text compression using antidictonaries. Rapport I.G.M. 98-10, Université de Marne-la-Vallée, 1998.
11. M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994.
12. M. Crochemore and R. Vérin. Direct construction of compact directed acyclic word graphs. In A Apostolico and J. Hein, editors, Combinatorial Pattern Matching, number 1264 in LNCS, pages 116-129. Springer-Verlag, 1997.
13. M. Crochemore and R. Vérin. On compact directed acyclic word graphs. In J. Mycielski, G. Rozenberg, and A. Salomaa, editors, Structures in Logic and Computer Science, number 1261 in LNCS, pages 192-211. Springer-Verlag, 1997.
14. 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.
15. D. Sunday. A very fast substring search algorithm. CACM, 33(8):132-142, August 1990.