Binary Interval Search: a scalable algorithm for counting interval intersections

Ryan M. Layer, Kevin Skadron, Gabriel Robins, Ira M. Hall, Aaron R. Quinlan
Department of Computer Science, University of Virginia, Charlottesville, VA 22904
Bioinformatics, Vol. 29, no. 1, pages 1-7, 2013


   author={Layer, Ryan M. and Skadron, Kevin and Robins, Gabriel and Hall, Ira M. and Quinlan, Aaron R.},

   title={Binary Interval Search: a scalable algorithm for counting interval intersections},










Download Download (PDF)   View View   Source Source   Source codes Source codes



MOTIVATION: The comparison of diverse genomic datasets is fundamental to understand genome biology. Researchers must explore many large datasets of genome intervals (e.g. genes, sequence alignments) to place their experimental results in a broader context and to make new discoveries. Relationships between genomic datasets are typically measured by identifying intervals that intersect, that is, they overlap and thus share a common genome interval. Given the continued advances in DNA sequencing technologies, efficient methods for measuring statistically significant relationships between many sets of genomic features are crucial for future discovery. RESULTS: We introduce the Binary Interval Search (BITS) algorithm, a novel and scalable approach to interval set intersection. We demonstrate that BITS outperforms existing methods at counting interval intersections. Moreover, we show that BITS is intrinsically suited to parallel computing architectures, such as graphics processing units by illustrating its utility for efficient Monte Carlo simulations measuring the significance of relationships between sets of genomic intervals. AVAILABILITY: https://github.com/arq5x/bits.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: