Sparse directed acyclic word graphs

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

Volumn 4209 LNCS, Issue , 2006, Pages 61-73

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

^a JAPAN SOCIETY FOR THE PROMOTION OF SCIENCE   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GRAPHIC METHODS; INDEXING (OF INFORMATION); TEXT PROCESSING; TREES (MATHEMATICS);

BIOLOGICAL SEQUENCES; DIRECTED ACYCLIC WORD GRAPHS (DAWG); SPARSE DIRECTED ACYCLIC WORD GRAPHS (SDAWG);

DATA STRUCTURES;

EID: 33750316388     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11880561_6     Document Type: Conference Paper

References (14)

1. Weiner, P.: Linear pattern-matching algorithms. In: Proc. of 14th IEEE Ann. Symp. on Switching and Automata Theory. (1973) 1-11
2. Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific (2002)
3. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997)
4. Kärkkänen, J., Ukkonen, E.: Sparse suffix trees. In: Proc. 2nd International Computing and Combinatorics Conference (COCOON'96). Volume 1090 of Lecture Notes in Computer Science., Springer-Verlag (1996) 219-230
5. Inenaga, S., Kivioja, T., Mäkinen, V.: Finding missing patterns. In: Proc. 4th Workshop on Algorithms in Bioinformatics (WABI'04). Volume 3240 of Lecture Notes in Bioinformatics., Springer-Verlag (2004) 463-474
6. 2) algorithm for discovering optimal boolean pattern pairs. IEEE/ACM Transactions on Computational Biology and Bioinformatics 1 (2004) 159-170
7. Inenaga, S., Bannai, H., Hyyrö, H., Shinohara, A., Takeda, M., Nakai, K., Miyano, S.: 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., Springer-Verlag (2004) 32-46
8. Baeza-Yates, R., Gonnet, G.H.: 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., Springer-Verlag (1989) 46-62
9. Andersson, A., Larsson, N.J., Swanson, K.: Suffix trees on words. Algorithmica 23 (1999) 246-260
10. Inenaga, S., Takeda, M.: On-line linear-time construction of word suffix trees. In: Proc. 17th Ann. Symp. on Combinatorial Pattern Matching (CPM'06). Lecture Notes in Computer Science, Springer-Verlag (2006) To appear.
11. Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The smallest automaton recognizing the subwords of a text. Theoretical Computer Science 40 (1985) 31-55
12. Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14 (1995) 249-260
13. Blumer, A., Blumer, J., Haussler, D., McConnell, R., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. Journal of the ACM 34 (1987) 578-595
14. Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics 146 (2005) 156-179