On the Size of DASG for Multiple Texts-Reference-Cited by-同舟云学术

On the Size of DASG for Multiple Texts

Published:2002 Issue: Volume: Page:58-64
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Crochemore Maxime,Troníček Zdeněk

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45735-6_6

Reference5 articles.

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 Coruña, Spain, 2000. IEEE Computer Society Press.

5. Z. Troníček 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.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Problems Related to Absent Subsequences;Combinatorial Optimization and Applications;2023-12-09

2. Tree String Path Subsequences Automaton and Its Use for Indexing XML Documents;Communications in Computer and Information Science;2015

3. Finding Conserved Gene Order Across Multiple Genomes;Comparative Genomics;2007

4. The Size of Subsequence Automaton;String Processing and Information Retrieval;2003