Author:
Apostolico A.,Iliopoulos C.,Landau G. M.,Schieber B.,Vishkin U.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference24 articles.
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A. Apostolico, On context-constrained squares and repetitions in a string,RAIRO Theoretical Informatics,18 (1984), 147–159.
3. NATO ASI Series, Series F: Computer and System Sciences, Vol. 12;A. Apostolico,1985
4. A. Apostolico and R. Giancarlo, The Boyer-Moore-Galil string searching strategies revisited,SIAM Journal on Computing,15 (1986), 98–105.
5. A. Apostolico and C. Iliopoulos, Parallel log-time construction of suffix trees, CSD TR 632, Department of Computer Science, Purdue University, Sept. 1986.
Cited by
116 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Full-text search engine with suffix index for massive heterogeneous data;Information Systems;2022-02
2. Finding Optimal Paths of All Lengths in Directed Grid Graphs;Artificial Intelligence Trends in Systems;2022
3. Counter based suffix tree for DNA pattern repeats;Theoretical Computer Science;2020-04
4. Distributed enhanced suffix arrays;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2019-11-17
5. Conclusion and Future Work;Shared-Memory Parallelism Can Be Simple, Fast, and Scalable;2017-06-09