Title of article
Space and time efficient parallel algorithms and software for EST clustering
Author/Authors
Kalyanaraman، Anantharaman نويسنده , , Aluru، Srinivas نويسنده , , V.، Brendel, نويسنده , , Kothari، Suresh نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
-1208
From page
1209
To page
0
Abstract
Expressed sequence tags, abbreviated as ESTs, are DNA molecules experimentally derived from expressed portions of genes. Clustering of ESTs is essential for gene recognition and for understanding important genetic variations such as those resulting in diseases. We present the algorithmic foundations and implementation of PaCE, a parallel software system we developed for large-scale EST clustering. The novel features of our approach include 1) design of spaceefficient algorithms to limit the space required to linear in the size of the input data set, 2) a combination of algorithmic techniques to reduce the total work without sacrificing the quality of EST clustering, and 3) use of parallel processing to reduce runtime and facilitate clustering of large data sets. Using a combination of these techniques, we report the clustering of 327,632 rat ESTs in 47 minutes, and 420,694 Triticum aestivum ESTs in 3 hours and 15 minutes, using a 60-processor IBM xSeries cluster. These problems are well beyond the capabilities of state-ofthe-art sequential software. We also present thorough experimental evaluation of our software including quality assessment using benchmark Arabidopsis EST data.
Keywords
Three-dimensional flow , Navier-Stokes equation , computational grids
Journal title
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
Serial Year
2003
Journal title
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
Record number
92261
Link To Document