Author:
Bauer Markus J.,Cox Anthony J.,Rosone Giovanna,Sciortino Marinella
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2(1), 53–86 (2004)
2. Lecture Notes in Computer Science;M.J. Bauer,2011
3. Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight algorithms for constructing and inverting the bwt of string collections. Theor. Comput. Sci. (in press, 2012)
4. Beller, T., Gog, S., Ohlebusch, E., Schnattinger, T.: Computing the longest common prefix array based on the Burrows-Wheeler transform. Journal of Discrete Algorithms (to appear)
5. Lecture Notes in Computer Science;T. Beller,2011
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献