Space and time efficient parallel algorithms and software for EST clustering
Anantharaman Kalyanaraman
Srinivas Aluru
Brendel, V.
Suresh Kothari
Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA;
This paper appears in: Parallel and Distributed Systems, IEEE Transactions on
Publication Date: Dec. 2003
Volume: 14,
Issue: 12
On page(s): 1209- 1221
ISSN: 1045-9219
INSPEC Accession Number: 7944400
Digital Object Identifier: 10.1109/TPDS.2003.1255634
Current Version Published: 2004-01-07
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 space-efficient 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-of-the-art sequential software. We also present thorough experimental evaluation of our software including quality assessment using benchmark Arabidopsis EST data.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
