Author:
Pockrandt Christopher,Ehrhardt Marcel,Reinert Knut
Publisher
Springer International Publishing
Reference22 articles.
1. Lecture Notes in Computer Science;D Belazzougui,2013
2. Belazzougui, D., Navarro, G.: Optimal lower and upper bounds for representing sequences. ACM Trans. Algorithms 11, 31 (2015)
3. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical report (1994)
4. Döring, A., Weese, D., Rausch, T., Reinert, K.: SeqAn an efficient, generic C++ library for sequence analysis. BMC Bioinform. 9, 11 (2008).
https://doi.org/10.1186/1471-2105-9-11
5. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Annual Symposium on Foundations of Computer Science (2000).
https://doi.org/10.1109/SFCS.2000.892127
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献