d2_cluster: A Validated Method for Clustering EST and Full-Length cDNA Sequences. Several efforts are under way to condense single-read expressed sequence tags (ESTs) and full-length transcript data on a large scale by means of clustering or assembly. One goal of these projects is the construction of gene indices where transcripts are partitioned into index classes (or clusters) such that they are put into the same index class if and only if they represent the same gene. Accurate gene indexing facilitates gene expression studies and inexpensive and early partial gene sequence discovery through the assembly of ESTs that are derived from genes that have yet to be positionally cloned or obtained directly through genomic sequencing. We describe d2_cluster, an agglomerative algorithm for rapidly and accurately partitioning transcript databases into index classes by clustering sequences according to minimal linkage or “transitive closure” rules. We then evaluate the relative efficiency of d2_cluster with respect to other clustering tools. UniGene is chosen for comparison because of its high quality and wide acceptance. It is shown that although d2_cluster and UniGene produce results that are between 83% and 90% identical, the joining rate of d2_cluster is between 8% and 20% greater than UniGene. Finally, we present the first published rigorous evaluation of under and over clustering (in other words, of type I and type II errors) of a sequence clustering algorithm, although the existence of highly identical gene paralogs means that care must be taken in the interpretation of the type II error. Upper bounds for these d2_cluster error rates are estimated at 0.4% and 0.8%, respectively. In other words, the sensitivity and selectivity of d2_cluster are estimated to be >99.6% and 99.2%.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Sahlin, Kristoffer; Medvedev, Paul: \textitDenovo clustering of long-read transcriptome data using a greedy, quality-value based algorithm (2019)
- Gunasinghe, Upuli; Alahakoon, Damminda; Bedingfield, Susan: Extraction of high quality (k)-words for alignment-free sequence comparison (2014)
- Burden, Conrad J.; Kantorovitz, Miriam R.; Wilson, Susan R.: Approximate word matches between two random sequences (2008)
- Kantorovitz, Miriam Ruth: An example of a stationary, triplewise independent triangular array for which the CLT fails (2007)
- Kantorovitz, M. R.; Booth, H. S.; Burden, C. J.; Wilson, S. R.: Asymptotic behavior of (k)-word matches between two uniformly distributed sequences (2007)