Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

Binary Interval Search

Published: 01 January 2013 Publication History

Abstract

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.
Supplementary information: Supplementary data are available at Bioinformatics online.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Bioinformatics
Bioinformatics  Volume 29, Issue 1
January 2013
147 pages

Publisher

Oxford University Press, Inc.

United States

Publication History

Published: 01 January 2013

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 22 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Parallel intersection counting on shared-memory multiprocessors and GPUsFuture Generation Computer Systems10.1016/j.future.2024.05.039159:C(423-431)Online publication date: 1-Oct-2024
  • (2018)Editorial from the Incoming Editor-in-ChiefIEEE Transactions on Computers10.1109/TC.2018.287942168:1(3-3)Online publication date: 10-Dec-2018
  • (2018)Optimal Binning for GenomicsIEEE Transactions on Computers10.1109/TC.2018.285488068:1(125-138)Online publication date: 10-Dec-2018
  • (2015)An efficient search algorithm for finding genomic-range overlaps based on the maximum range lengthIEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)10.1109/TCBB.2014.236904212:4(778-784)Online publication date: 1-Jul-2015
  • (2013)A Parallel Data Distribution Management AlgorithmProceedings of the 2013 IEEE/ACM 17th International Symposium on Distributed Simulation and Real Time Applications10.1109/DS-RT.2013.23(145-152)Online publication date: 30-Oct-2013

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media