8894

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
@article{Layer01012013,

   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},

   volume={29},

   number={1},

   pages={1-7},

   year={2013},

   doi={10.1093/bioinformatics/bts652},

   URL={http://bioinformatics.oxfordjournals.org/content/29/1/1.abstract},

   eprint={http://bioinformatics.oxfordjournals.org/content/29/1/1.full.pdf+html},

   journal={Bioinformatics}

}

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

597

views

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.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

* * *

* * *

Like us on Facebook

HGPU group

171 people like HGPU on Facebook

Follow us on Twitter

HGPU group

1282 peoples are following HGPU @twitter

* * *

Free GPU computing nodes at hgpu.org

Registered users can now run their OpenCL application at hgpu.org. We provide 1 minute of computer time per each run on two nodes with two AMD and one nVidia graphics processing units, correspondingly. There are no restrictions on the number of starts.

The platforms are

Node 1
  • GPU device 0: AMD/ATI Radeon HD 5870 2GB, 850MHz
  • GPU device 1: AMD/ATI Radeon HD 6970 2GB, 880MHz
  • CPU: AMD Phenom II X6 @ 2.8GHz 1055T
  • RAM: 12GB
  • OS: OpenSUSE 13.1
  • SDK: AMD APP SDK 2.9
Node 2
  • GPU device 0: AMD/ATI Radeon HD 7970 3GB, 1000MHz
  • GPU device 1: nVidia GeForce GTX 560 Ti 2GB, 822MHz
  • CPU: Intel Core i7-2600 @ 3.4GHz
  • RAM: 16GB
  • OS: OpenSUSE 12.2
  • SDK: nVidia CUDA Toolkit 6.0.1, AMD APP SDK 2.9

Completed OpenCL project should be uploaded via User dashboard (see instructions and example there), compilation and execution terminal output logs will be provided to the user.

The information send to hgpu.org will be treated according to our Privacy Policy

HGPU group © 2010-2014 hgpu.org

All rights belong to the respective authors

Contact us: