Sparse compact directed acyclic word graphs

Proceedings of the Prague Stringology Conference '06

Volumn , Issue , 2006, Pages 197-211

  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

BIOLOGICAL SEQUENCE ANALYSIS; COMPACT DIRECTED ACYCLIC WORD GRAPHS; CONSTRUCTION ALGORITHMS; DIRECTED ACYCLIC WORD GRAPHS; EXACT-PATTERN MATCHING; NATURAL LANGUAGE PROCESSING; ON-LINE ALGORITHMS; RESEARCH DIRECTIONS; SPECIAL WORD; SUFFIX-TREES; TEXT-INDEXING;

ALGORITHMS; INDEXING (OF INFORMATION); NATURAL LANGUAGE PROCESSING SYSTEMS; PATTERN MATCHING;

FORESTRY;

EID: 37849020017     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A. Andersson, N. J. Larsson, and K. Swanson: Suffix trees on words. Algorithmica, 23(3) 1999, pp. 246-260.
2. 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) 2004, pp. 273-288.
3. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen, and J. Seiferas: The smallest automaton recognizing the subwords of a text. Theoretical Computer Science, 40 1985, pp. 31-55.
4. A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht: Complete inverted files for efficient text retrieval and analysis. Journal of the ACM, 34(3) 1987, pp. 578-595.
5. 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), AAAI Press, 2000, pp. 128-133.
6. S. Inenaga, T. Funamoto, M. Takeda, and A. Shinohara: Linear-time off-line text compression by longest-first substitution, in Proc. 10th International Symp. on String Processing and Information Retrieval (SPIRE'03), vol. 2857 of Lecture Notes in Computer Science, Springer-Verlag, 2003, pp. 137-152.
7. S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa, G. Mauri, and G. Pavesi: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics, 146(2) 2005, pp. 156-179.
8. S. Inenaga and M. Takeda: On-line linear-time construction of word suffix trees, in Proc. 17th Ann. Symp. on Combinatorial Pattern Matching (CPM'06), vol. 4009 of Lecture Notes in Computer Science, Springer-Verlag, 2006, pp. 60-71.
9. S. Inenaga and M. Takeda: Sparse directed acyclic word graphs, in Proc. 13th International Symp. on String Processing and Information Retrieval (SPIRE'06), Lecture Notes in Computer Science, Springer-Verlag, 2006, To appear.
10. N. J. Larsson: Extended application of suffix trees to data compression, in Proc. Data Compression Conference '96 (DCC'96), IEEE Computer Society, 1996, pp. 190-199.
11. 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), ACM, 2000, pp. 210-219.
12. 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) 2003, pp. 87-101.
13. D. Revuz: Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science, 92(1) 1992, pp. 181-189.
14. E. Ukkonen: On-line construction of suffix trees. Algorithmica, 14(3) 1995, pp. 249-260.