Computing the BWT and the LCP array in constant space

DOI10.1007/978-3-319-29516-9_26MaRDI QIDQ2798242zbMATH OpenOpenAlexFDO

Authors Felipe A. Louza, Guilherme P. Telles

Publication date 4 April 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-29516-9_26

zbMATH Keywords

Burrows-Wheeler transformconstant space algorithmslongest common prefix array

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• Burrows-Wheeler transform and LCP array construction in constant space
• A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
• Algorithm Theory - SWAT 2004
• Computing the Burrows-Wheeler transform in place and in small space
• Fast BWT in small space by blockwise suffix sorting

Cited in

(6)

• Computing the longest common prefix array based on the Burrows-Wheeler transform
• A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform
• Space-efficient computation of the LCP array from the Burrows-Wheeler transform
• Burrows-Wheeler transform and LCP array construction in constant space
• Fast and Lightweight LCP-Array Construction Algorithms
• Algorithm Theory - SWAT 2004

This page was built for publication: Computing the BWT and the LCP array in constant space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798242)