Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new algorithm for a distributed environment. Theory Comput. Syst. 37, 441–456 (2004)
2. Antonitio, R.P.J., Smyth, W.F., Turpin, A., Yu, X.: New suffix array algorithms — linear but not fast? In: Proc. Fifteenth Australasian Workshop Combinatorial Algorithms (AWOCA), pp. 148–156 (2004)
3. Cole, R., Hariharan, R.: Dynamic LCA queries on trees. SIAM J. Comput. 34(4), 894–923 (2005)
4. Lecture Notes in Computer Science;J. Fischer,2010
5. Lecture Notes in Computer Science;J. Fischer,2007
Cited by
50 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Grammar Compression by Induced Suffix Sorting;ACM Journal of Experimental Algorithmics;2022-08-26
2. Faster algorithms for 1-mappability of a sequence;Theoretical Computer Science;2020-04
3. Apache Spark Implementations for String Patterns in DNA Sequences;Advances in Experimental Medicine and Biology;2020
4. Conclusions;Construction of Fundamental Data Structures for Strings;2020
5. Inducing the Lyndon Array;Construction of Fundamental Data Structures for Strings;2020