- Book Chapter
7
- 10.1007/978-3-319-94418-0_11
Divide and Conquer Computation of the Multi-string BWT and LCP Array
- Jan 01, 2018
- Paola Bonizzoni + 5 more +5
Indexing huge collections of strings, such as those produced by the widespread sequencing technologies, heavily relies on multi-string generalizations of the Burrows-Wheeler Transform (BWT) and the Longest Common Prefix (LCP) array, since solving efficiently both problems are essential ingredients of several algorithms on a collection of strings.
Read more