Graphics processing unit implementations of relative expression analysis algorithms enable dramatic computational speedup.
CONCLUSIONS
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.


BACKGROUND
http://www.igb.illinois.edu/labs/price/downloads/.
Department of Computer Science, University of Illinois, Urbana, IL 61801, USA.
Andrew T
AT
Magis
John C
JC
Earls
Youn-Hee
YH
Ko
James A
JA
Eddy
Nathan D
ND
Price
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D003196:Computer Graphics; D020869:Gene Expression Profiling / Q000379:methods*; D006801:Humans
Nat Med. 2001 Jun;7(6):673-9
11385503
Nat Methods. 2008 Jul;5(7):613-9
18516046
J Mol Graph Model. 2010 Sep;29(2):116-25
20675161
Proc Natl Acad Sci U S A. 2003 Apr 1;100(7):4168-72
12642676
Technol Cancer Res Treat. 2010 Apr;9(2):149-59
20218737
Bioinformatics. 2005 Oct 15;21(20):3896-904
16105897
BMC Bioinformatics. 2009 Aug 20;10:256
19695104
Bioinformatics. 2009 May 1;25(9):1203-4
19276151
Proc Natl Acad Sci U S A. 2000 Jan 4;97(1):262-7
10618406
Proc Natl Acad Sci U S A. 2007 Feb 27;104(9):3414-9
17360660
Stat Appl Genet Mol Biol. 2004;3:Article19
16646797
J Parallel Distrib Comput. 2008 Oct;68(10):1307-1318
21796230