External memory BWT and LCP computation for sequence collections with applications

Title
External memory BWT and LCP computation for sequence collections with applications
Authors
Keywords
Burrows–Wheeler Transform, Longest common prefix array, Maximal repeats, All pairs suffix–prefix overlaps, Succinct de Bruijn graph, External memory algorithms
Journal
Algorithms for Molecular Biology
Volume 14, Issue 1, Pages -
Publisher
Springer Nature
Online
2019-03-09
DOI
10.1186/s13015-019-0140-0

Ask authors/readers for more resources

Reprint

Contact the author

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