Author:
Beller Timo,Zwerger Maike,Gog Simon,Ohlebusch Enno
Publisher
Springer International Publishing
Reference19 articles.
1. Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight algorithms for constructing and inverting the BWT of string collections. Theoretical Computer Science 483, 134–148 (2013)
2. Beller, T., Gog, S., Ohlebusch, E., Schnattinger, T.: Computing the longest common prefix array based on the Burrows-Wheeler transform. Journal of Discrete Algorithms 18, 22–31 (2013)
3. Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 360–369 (1997)
4. Bingmann, T., Fischer, J., Osipov, V.: Inducing suffix and lcp arrays in external memory. In: Proc. Wkshp. Algorithm Engineering and Experiments (2013)
5. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Research Report 124, Digital Systems Research Center (1994)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Indexing Highly Repetitive String Collections, Part II;ACM Computing Surveys;2022-03-31
2. Space-efficient construction of compressed suffix trees;Theoretical Computer Science;2021-01
3. Dynamic construction of pan-genome subgraphs;Open Computer Science;2020-04-09
4. Inducing the Lyndon Array;Construction of Fundamental Data Structures for Strings;2020
5. Induced Suffix Sorting;Construction of Fundamental Data Structures for Strings;2020