Efficient Compression and Indexing for Highly Repetitive DNA Sequence Collections

In this paper, we focus upon the important problem of indexing and searching highly repetitive DNA sequence collections. Given a collection \mathcal {G} G of t t sequences \mathcal {S}_{i} Si of length n n each, we can represent \mathcal {G} G succinctly in 2n\mathcal {H}_{k}(\mathcal {T}) + \mathcal {O}(n^{\prime }\ {\log \log n}) + o(q n^{\prime }) + o(tn) 2nHk(T)+O(n'loglogn)+o(qn')+o(tn) bits using \mathcal {O}(t n^{2} + q n^{\prime }) O(tn2