Ontology highlight
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/.
SUBMITTER: Magis AT
PROVIDER: S-EPMC3051334 | biostudies-literature | 2011 Mar
REPOSITORIES: biostudies-literature
Magis Andrew T AT Earls John C JC Ko Youn-Hee YH Eddy James A JA Price Nathan D ND
Bioinformatics (Oxford, England) 20110120 6
<h4>Summary</h4>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 disc ...[more]