On-line linear-time construction of word suffix trees

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

Volumn 4009 LNCS, Issue , 2006, Pages 60-71

  Inenaga, Shunsuke ^a   Takeda, Masayuki ^a,b  

^a KYUSHU UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; LINEAR SYSTEMS; LINGUISTICS; NATURAL LANGUAGE PROCESSING SYSTEMS; PATTERN MATCHING; TREES (MATHEMATICS);

INPUT STRING; KEY DATA STRUCTURE; LINEAR-TIME CONSTRUCTION; SPARSE SUFFIX TREES;

WORD PROCESSING;

EID: 33746067513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_7     Document Type: Conference Paper

References (19)

1. A. V. Aho and M. Corasick. Efficient string matching: An aid to bibliographic search. Comm. ACM, 18(6):333-340, 1975.
2. A. Andersson, N. J. Larsson, and K. Swanson. Suffix trees on words. Algorithmica, 23(3):246-260, 1999.
3. A. Apostolico. The myriad virtues of subword trees. Combinatorial Algorithms on Words, F12:85-96, 1985.
4. R. Baeza-Yates and G. H. Gonnet. Efficient text searching of regular expressions. In Proc. 16th International Colloquium on Automata, Languages and Programming (ICALP'89), volume 372 of Lecture Notes in Computer Science, pages 46-62. Springer-Verlag, 1989.
5. H. Bannai, S. Inenaga, A. Shinohara, M. Takeda, and S. Miyano. Efficiently finding regulatory elements using correlation with gene expression. Journal of Bioinformatics and Computational Biology, 2(2):273-288, 2004.
6. R. Clifford and M. Sergot. Distributed and paged suffix trees for large genetic databases. In Proc. 14th Ann. Symp. on Combinatorial Pattern Matching (CPM'03), volume 2676 of Lecture Notes in Computer Science, pages 70-82. Springer-Verlag, 2003.
7. B. Dorohonceanu and C. G. Nevill-Manning. Accelerating protein classification using suffix trees. In Proc. 8th International Conference on Intelligent Systems for Molecular Biology (ISMB'00), pages 128-133. AAAI Press, 2000.
8. D. Gusfield. Algorithms an Strings, Threes, and Sequences. Cambridge University Press, 1997.
9. S. Inenaga, H. Bannai, H. Hyyrö, A. Shinohara, M. Takeda, K. Nakai, and S. Miyano. Finding optimal pairs of cooperative and competing patterns with bounded distance. In Proc. 7th International Conference on Discovery Science (DS'04), volume 3245 of Lecture Notes in Artificial Intelligence, pages 32-46. Springer-Verlag, 2004.
10. S. Inenaga, T. Funamoto, M. Takeda, and A. Shinoliara. Linear-time off-line text compression by longest-first substitution. In Proc. 10th International Symp. on String Processing and Information Retrieval (SPIRE'03), volume 2857 of Lecture Notes in Computer Science, pages 137-152. Springer-Verlag, 2003.
11. S. Inenaga, T. Kivioja, and V. Mäkinen. Finding missing patterns. In Proc. 4th Workshop on Algorithms in Bioinformatics (WABI'04), volume 3240 of Lecture Notes in Bioinformatics, pages 463-474. Springer-Verlag, 2004.
12. J. Kärkkänen and E. Ukkonen. Sparse suffix trees, In Proc. 2nd International Computing and Combinatorics Conference (COCOON'96), volume 1090 of Lecture Notes in Computer Science, pages 219-230, Springer-Verlag, 1996.
13. N. J. Larsson. Extended application of suffix trees to data compression, In Proc. Data Compression Conference '96 (DCC'96), pages 190-199, IEEE Computer Society, 1996.
14. L. Marsan and M.-F, Sagot, Extracting structured motifs using a suffix tree - algorithms and application to promoter consensus identification. In Proc. 4th Annual International Conference on Computational Molecular Biology (RECOMB'00), pages 210-219. ACM, 2000.
15. E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of ACM, 23(2) ;262-272, 1976.
16. J. C. Na, A. Apostolico, C. S. Iliopoulos, and K. Park. Truncated suffix trees and their application to data compression. Theoretical Computer Science, 304(1-3):87-101, 2003.
17. M. Takeda, S. Miyamoto, T. Kida, A. Shinohara, S. Fukamachi, T. Shinohara, and S. Arikawa. Processing text files as is: Pattern matching over compressed texts, multi-byte character texts, and semi-structured texts. In Proc. 9th International Symp. on String Processing and Information Retrieval (SPIRE'02), volume 2476 of Lecture Notes in Computer Science, pages 170-186. Springer-Verlag, 2002.
18. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
19. P. Weiner. Linear pattern-matching algorithms. In Proc. of 14th IEEE Ann. Symp. on Switching and Automata Theory, pages 1-11, 1973.