Binary Interval Search: A scalable algorithm for counting interval intersections

Bioinformatics

Volumn 29, Issue 1, 2013, Pages 1-7

  Layer, Ryan M ^a   Skadron, Kevin ^a   Robins, Gabriel ^a   Hall, Ira M ^b   Quinlan, Aaron R ^b  

^a University of Virginia   (United States)

^b UNIVERSITY OF VIRGINIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; DNA SEQUENCE; GENOMICS; METHODOLOGY; MONTE CARLO METHOD; SEQUENCE ALIGNMENT;

ALGORITHMS; GENOMICS; MONTE CARLO METHOD; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA;

EID: 84871808580     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts652     Document Type: Article

References (17)

1. Alekseyenko, A.V. and Lee, C.J. (2007) Nested containment list (NCList): a new algorithm for accelerating interval query of genome alignment and interval databases. Bioinformatics, 23, 1386-1393. (Pubitemid 47050521)
2. ENCODE Project Consortium (2007) Identification and analysis of functional elements in 1% of the human genome by the ENCODE pilot project. Nature, 447, 799-816.
3. Favorov, A. et al. (2012) Exploring massive, genome scale datasets with the GenometriCorr package. PLoS Comput. Biol., 8, e1002529.
4. Gerstein, M.B. et al. (2010) Integrative analysis of the Caenorhabditis elegans genome by the modENCODE project. Science, 330, 1775-1787.
5. Giardine, B. et al. (2005) Galaxy: a platform for interactive large-scale genome analysis. Genome Res., 15, 1451-1455. (Pubitemid 41400913)
6. Kent, W.J. et al. (2002) The human genome browser at UCSC. Genome Res., 12, 996-1006.
7. Kirk, D. and Hwu, W. (2010) Programming Massively Parallel Processors: A Hands-On Approach. Elsevier, Burlington, MA.
8. Li, H. et al. (2009) The sequence alignment/map (SAM) format and SAMtools. Bioinformatics, 25, 2078-2049.
9. McKenney, M. and McGuire, T. (2009) A parallel plane sweep algorithm for multi-core systems. In Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. GIS '09, pp. 392-395. ACM New York, NY, USA.
10. Merrill, D. and Grimshaw, A. (2011) High performance and scalable radix sorting: a case study of implementing dynamic parallelism for GPU computing. Parallel Process. Lett., 21, 245-272.
11. Mirsa, J. and Gries, D. (1982) Finding repeated elements. Sci. Comput. Progr., 2, 143-152.
12. Neph, S. et al. (2012) BEDOPS: high performance genomic feature operations. Bioinformatics, 28, 1919-1920.
13. Quinlan, A.R. and Hall, I.M. (2011) BEDTools: a flexible suite of utilities for comparing genomic features. Bioinformatics, 26, 841-842.
14. Richardson, J.E. (2006) fjoin: simple and efficient computation of feature overlaps. J. Computat. Biol., 13, 1457-1464.
15. Satish, N. et al. (2009) Designing efficient sorting algorithms for manycore GPUs. In International Symposium on Parallel and Distributed Processing, 2009. IPDPS '09, pp. 1-10.
16. IEEE. The 1000 Genomes Project Consortium (2010) A map of human genome variation from population-scale sequencing. Nature, 467, 1061-1073.
17. Tzeng, S. and Wei, L.Y. (2008) Parallel white noise generation on a GPU via cryptographic hash. In Proceedings of the 2008 Symposium on Interactive 3D Graphics and Games. I3D '08, pp. 79-87. ACM, New York, NY, USA.