Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
Indexing highly repetitive texts—such as genomic databases, software repositories and versioned text collections—has become an important problem since the turn of the millennium. A relevant compressibility measure for repetitive texts is r , the number of runs in their Burrows-Wheeler Transforms (BWTs). One of the earliest indexes for repetitive collections, …