Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference26 articles.
1. Replacing suffix trees with enhanced suffix arrays;Abouelhoda;J. Discret. Algorithms,2004
2. Lightweight BWT construction for very large string collections;Bauer,2011
3. Lightweight LCP construction for next-generation sequencing datasets;Bauer,2012
4. Lightweight algorithms for constructing and inverting the BWT of string collections;Bauer;Theor. Comput. Sci.,2013
5. Computing the longest common prefix array based on the Burrows–Wheeler transform;Beller;J. Discret. Algorithms,2013
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献