The size of subsequence automaton

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

Volumn 2857, Issue , 2003, Pages 304-310

  Troníček, Zdeněk ^a   Shinohara, Ayumi ^b,c  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b KYUSHU UNIVERSITY   (Japan)

^c JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

LOWER BOUNDS; NUMBER OF STATE; SUBSEQUENCE AUTOMATON;

ARTIFICIAL INTELLIGENCE;

EID: 0142156689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39984-1_23     Document Type: Article

References (6)

1. R. A. Baeza-Yates. Searching subsequences. Theor. Comput. Sci., 78(2):363-376, 1991.
2. M. Crochemore and Z. Troníček. Directed acyclic subsequence graph for multiple texts. Rapport I.G.M. 99-13, Université de Marne-la-vallée, 1999.
3. M. Crochemore and Z. Troníček. On the size of DASG for multiple texts. In Proceedings of the Symposium on String Processing and Information Retrieval 2002, pages 58-64, Lisbon, 2002.
4. H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. Online construction of subsequence automata for multiple texts. In Proceedings of the Symposium on String Processing and Information Retrieval 2000, La Coruña, Spain, 2000. IEEE Computer Society Press.
5. ∼njas/sequences/.
6. Z. Troníček. Common subsequence automaton. In International Conference on Implementation and Application of Automata 2002, Tours, France, 2002.