Substring search and repeat search using factor oracles

Information Processing Letters

Volumn 93, Issue 6, 2005, Pages 269-274

  Kato, Ryoichi ^a   Watanabe, Osamu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Algorithms; Automaton; Repetition search; Substring search; Suffix trees

Indexed keywords

APPROXIMATION THEORY; AUTOMATA THEORY; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

REPETITION SEARCH; SUBSTRING SEARCH; SUFFIX-TREES;

ALGORITHMS;

EID: 13844296357     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.11.011     Document Type: Article

References (5)

1. C. Allauzen, M. Crochemore, and M. Raffinot Factor oracle: A new structure for pattern matching Proc. of Conference on Current Trends in Theory and Practice of Informatics 1999 295 310
2. C. Allauzen, M. Crochemore, and M. Raffinot Efficient experimental string matching by weak factor recognition Lecture Notes in Comput. Sci. vol. 2089 2001 Springer Berlin 51 72
3. A. Lefebvre, and T. Lecroq Computing repeated factors with a factor oracle Proc. 11th Australasian Workshop on Combinatorial Algorithms 2000 145 158
4. A. Lefebvre, and T. Lecroq Compror: on-line lossless data compression with a factor oracle Inform. Process. Lett. 83 1 2001 1 6
5. A. Lefebvre, T. Lecroq, and J. Alexandre Drastic improvements over repeats found with a factor oracle Proc. 13th Australasian Workshop on Combinatorial Algorithms 2002 253 265