On the size of DASG for multiple texts

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

Volumn 2476, Issue , 2002, Pages 58-64

  Crochemore, Maxime ^b   Tronì ček, Zdenĕk ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

LEFT-TO-RIGHT ALGORITHM; NUMBER OF STATE;

INFORMATION RETRIEVAL;

EID: 84958769749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45735-6_6     Document Type: Conference Paper

References (5)

1. R.A. Baeza-Yates. Searching subsequences. Theor. Comput. Sci., 78(2):363–376, 1991.
2. J.-J. Hèbrard and M. Crochemore.: Calcul de la distance par les sous-mots. RAIRO Inform. Thèor. Appl., 20(4):441–456, 1986.
3. M. Hirao, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find best subsequence patterns. In Proceedings of the 3rd International Conference on Discovery Science, volume 1967, pages 141–154. Springer-Verlag, Berlin, 2000.
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 Coruna, Spain, 2000. IEEE Computer Society Press.
5. Z. Tronìcek and B. Melichar. Directed acyclic subsequence graph. In J. Holub and M. Simànek, editors, Proceedings of the Prague Stringology Club Workshop’98, pages 107–118, Czech Technical University, Prague, Czech Republic, 1998. Collaborative Report DC–98–06.