Highly repetitive strings are increasingly being amassed by genome sequencing experiments, and by versioned archives of source code and webpages. We describe practical data structures that support counting and locating all the exact occurrences of a pattern in a repetitive text, by combining the run-length encoded Burrows-Wheeler transform (RLBWT) with the boundaries of Lempel-Ziv 77 factors. One such variant uses an amount of space comparable to LZ77 indexes, but it answers count queries between two and four orders of magnitude faster than all LZ77 and hybrid index implementations, at the cost of slower locate queries. Combining the RLBWT with the compact directed acyclic word graph answers locate queries for short patterns between four and ten times faster than a version of the run-length compressed suffix array (RLCSA) that uses comparable memory, and with very short patterns our index achieves speedups even greater than ten with respect to RLCSA.
|Data di pubblicazione:||2017|
|Titolo:||Flexible indexing of repetitive collections|
|Titolo del libro:||Unveiling Dynamics and Complexity: 13th Conference on Computability in Europe, CiE 2017, Proceedings|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-319-58741-7_17|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|
File in questo prodotto: