Divide and conquer computation of the multi-string BWT and LCP array

DOI10.1007/978-3-319-94418-0_11OpenAlexW2809922887MaRDI QIDQ1670729

Marco Previtali, Gianluca Della Vedova, Yuri Pirola, Raffaella Rizzi, Serena Nicosia, Paola Bonizzoni

Publication date: 6 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94418-0_11

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (5)

Space-efficient construction of compressed suffix trees ⋮ Lightweight BWT and LCP Merging via the Gap Algorithm ⋮ Computing the multi-string BWT and LCP array in external memory ⋮ Unnamed Item ⋮ Space-efficient computation of the LCP array from the Burrows-Wheeler transform

This page was built for publication: Divide and conquer computation of the multi-string BWT and LCP array