Issue No. 12 - December (2003 vol. 14)
Anantharaman Kalyanaraman , IEEE
Srinivas Aluru , IEEE
<p><b>Abstract</b>—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. In this paper, we present the algorithmic foundations and implementation of <tmath>PaCE</tmath>, 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 <it>Triticum aestivum</it> 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 <it>Arabidopsis</it> EST data.</p>
Computational biology, EST clustering, maximal common substring, parallel algorithms, suffix tree applications.
Volker Brendel, Suresh Kothari, Anantharaman Kalyanaraman, Srinivas Aluru, "Space and Time Efficient Parallel Algorithms and Software for EST Clustering", IEEE Transactions on Parallel & Distributed Systems, vol. 14, no. , pp. 1209-1221, December 2003, doi:10.1109/TPDS.2003.1255634