External memory BWT and LCP computation for sequence collections with applications

标题
External memory BWT and LCP computation for sequence collections with applications
作者
关键词
Burrows–Wheeler Transform, Longest common prefix array, Maximal repeats, All pairs suffix–prefix overlaps, Succinct de Bruijn graph, External memory algorithms
出版物
Algorithms for Molecular Biology
Volume 14, Issue 1, Pages -
出版商
Springer Nature
发表日期
2019-03-09
DOI
10.1186/s13015-019-0140-0

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started