Author:
Crochemore Maxime,Vérin Renaud
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. A. Apostolico. The myriad virtues of subword trees. In A. Apostolico & Z. Galil, editor, Combinatorial Algorithms on Words., pages 85–95. Springer-Verlag, 1985.
2. A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, and R. McConnel. Linear size finite automata for the set of all subwords of a word: an outline of results. Bull. European Assoc. Theoret. Comput. Sci., 21:12–20, 1983.
3. A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M.T. Chen, and J. Seiferas. The smallest automaton recognizing the subwords of a text. Theoret. Comput. Sci., 40:31–55, 1985.
4. A. Blumer, J. Blumer, D. Haussler, and R. McConnell. Complete inverted files for efficient text retrieval and analysis. Journal of the Association for Computing Machinery, 34(3):578–595, July 1987.
5. A. Blumer, D. Haussler, and A. Ehrenfeucht. Average sizes of suffix trees and dawgs. Discrete Applied Mathematics, 24:37–45, 1989.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Sensitivity of Compact Directed Acyclic Word Graphs;Lecture Notes in Computer Science;2023
2. DAFSA: a Python library for Deterministic Acyclic Finite State Automata;Journal of Open Source Software;2020-02-19
3. Apache Spark Implementations for String Patterns in DNA Sequences;Advances in Experimental Medicine and Biology;2020
4. At the roots of dictionary compression: string attractors;Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing;2018-06-20
5. Suffix Tree;Encyclopedia of Database Systems;2017