| Literature DB >> 21257608 |
Andrew T Magis1, John C Earls, Youn-Hee Ko, James A Eddy, Nathan D Price.
Abstract
SUMMARY: The top-scoring pair (TSP) and top-scoring triplet (TST) algorithms are powerful methods for classification from expression data, but analysis of all combinations across thousands of human transcriptome samples is computationally intensive, and has not yet been achieved for TST. Implementation of these algorithms for the graphics processing unit results in dramatic speedup of two orders of magnitude, greatly increasing the searchable combinations and accelerating the pace of discovery. AVAILABILITY: http://www.igb.illinois.edu/labs/price/downloads/.Entities:
Mesh:
Year: 2011 PMID: 21257608 PMCID: PMC3051334 DOI: 10.1093/bioinformatics/btr033
Source DB: PubMed Journal: Bioinformatics ISSN: 1367-4803 Impact factor: 6.937