Hybrid Indexes for Repetitive Datasets
Data Structures and Algorithms
2015-06-16 v1
Abstract
Advances in DNA sequencing mean databases of thousands of human genomes will soon be commonplace. In this paper we introduce a simple technique for reducing the size of conventional indexes on such highly repetitive texts. Given upper bounds on pattern lengths and edit distances, we preprocess the text with LZ77 to obtain a filtered text, for which we store a conventional index. Later, given a query, we find all matches in the filtered text, then use their positions and the structure of the LZ77 parse to find all matches in the original text. Our experiments show this also significantly reduces query times.
Cite
@article{arxiv.1306.4037,
title = {Hybrid Indexes for Repetitive Datasets},
author = {H. Ferrada and T. Gagie and T. Hirvola and S. J. Puglisi},
journal= {arXiv preprint arXiv:1306.4037},
year = {2015}
}