Background Sequencing technologies produce larger and larger collections of
biosequences that have to be stored in compressed indices supporting fast search …

Indexing huge collections of strings, such as those produced by the widespread sequencing
technologies, heavily relies on multistring generalizations of the Burrows–Wheeler transform …

We show that the Longest Common Prefix Array of a text collection of total size n on
alphabet [1,{\sigma}] can be computed from the Burrows-Wheeler transformed collection in …

Indexing very large collections of strings, such as those produced by the widespread next
generation sequencing technologies, heavily relies on multi-string generalization of the …

Abstract Background The development of Next Generation Sequencing (NGS) has had a
major impact on the study of genetic sequences. Among problems that researchers in the …

We show how to build several data structures of central importance to string processing by
taking as input the Burrows-Wheeler transform (BWT) and using small extra working space …

Abstract The development of Next Generation Sequencing has had a major impact on the
study of genetic sequences, and in particular, on the advancement of metagenomics, whose …

Indexing very large collections of strings, such as those produced by the widespread next
generation sequencing technologies, heavily relies on multistring generalization of the …