General suffix automaton construction algorithm and space bounds

Theoretical Computer Science

Volumn 410, Issue 37, 2009, Pages 3553-3562

  Mohri, Mehryar ^a,b   Moreno, Pedro ^b   Weinstein, Eugene ^a,b  

^a NEW YORK UNIVERSITY   (United States)

^b GOOGLE INC   (United States)

Author keywords

Factor automata; Finite automata; Indexing; Inverted text; Music identification; Pattern matching; String matching; Suffix automata; Suffix trees

Indexed keywords

FACTOR AUTOMATA; INDEXING; INVERTED TEXT; MUSIC IDENTIFICATION; STRING-MATCHING; SUFFIX AUTOMATA; SUFFIX TREES;

CLUSTERING ALGORITHMS; DATA STRUCTURES; FINITE AUTOMATA; INDEXING (OF INFORMATION); MATRIX ALGEBRA; PATTERN MATCHING; SET THEORY; TRANSLATION (LANGUAGES);

ROBOTS;

EID: 67651095813     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.03.034     Document Type: Article

References (14)

1. Gusfield D. Algorithms on Strings, Trees, and Sequences (1997), Cambridge University Press, Cambridge, UK
2. Crochemore M., and Rytter W. Jewels of Stringology (2002), World Scientific
3. C. Allauzen, M. Mohri, M. Saraclar, General indexation of weighted automata - Application to spoken utterance retrieval, in: Proceedings of the Workshop on Interdisciplinary Approaches to Speech Indexing and Retrieval (HLT/NAACL), Boston, Massachusetts, 2004, pp. 33-40
4. E. Weinstein, P. Moreno, Music identification with weighted finite-state transducers, in: Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, ICASSP, Honolulu, Hawaii, 2007, pp. 689-692
5. Blumer A., Blumer J., Haussler D., Ehrenfeucht A., Chen M.T., and Seiferas J.I. The smallest automaton recognizing the subwords of a text. Theoretical Computer Science 40 (1985) 31-55
6. Crochemore M. Transducers and repetitions. Theoretical Computer Science 45 (1986) 63-86
7. Blumer A., Blumer J., Haussler D., McConnell R.M., and Ehrenfeucht A. Complete inverted files for efficient text retrieval and analysis. Journal of the ACM 34 (1987) 578-589
8. Inenaga S., Hoshino H., Shinohara A., Takeda M., Arikawa S., Mauri G., and Pavesi G. On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics 146 2 (2005) 156-179
9. M. Mohri, P. Moreno, E. Weinstein, Robust music identification, detection, and analysis, in: Proceedings of the International Conference on Music Information Retrieval, ISMIR, Vienna, Austria, 2007, pp. 135-139
10. Allauzen C., Crochemore M., and Raffinot M. Efficient experimental string matching by weak factor recognition. Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching. CPM (2001), Springer-Verlag, London, UK 51-72
11. Revuz D. Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science 92 (1992) 181-189
12. J.A. Blumer, Algorithms for the directed acyclic word graph and related structures, Ph.D. Thesis, Denver University, 1985
13. Mohri M. Finite-state transducers in language and speech processing. Computational Linguistics 23 2 (1997) 269-311
14. Mohri M. Statistical Natural Language Processing. In: Lothaire M. (Ed). Applied Combinatorics on Words (2005), Cambridge University Press