2003
DOI: 10.1109/tpds.2003.1255634
|View full text |Cite
|
Sign up to set email alerts
|

Space and time efficient parallel algorithms and software for EST clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2003
2003
2011
2011

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(17 citation statements)
references
References 26 publications
0
17
0
Order By: Relevance
“…Sequence base calls, vector trimming, and low-quality sequence filtering were performed by the Arizona Genomics Computation Laboratory as described elsewhere (Udall et al, 2006). EST sequences were initially clustered using PaCE (Kalyanaraman et al, 2003) and subsequently assembled using CAP3 (Huang and Madan, 1999). Functional annotations for each EST and contig consensus sequence were generated by BLASTing (Altschul et al, 1990) against the UniProt database with a cutoff of 1 e-10 .…”
Section: Cdna Library Construction For Line MCmentioning
confidence: 99%
“…Sequence base calls, vector trimming, and low-quality sequence filtering were performed by the Arizona Genomics Computation Laboratory as described elsewhere (Udall et al, 2006). EST sequences were initially clustered using PaCE (Kalyanaraman et al, 2003) and subsequently assembled using CAP3 (Huang and Madan, 1999). Functional annotations for each EST and contig consensus sequence were generated by BLASTing (Altschul et al, 1990) against the UniProt database with a cutoff of 1 e-10 .…”
Section: Cdna Library Construction For Line MCmentioning
confidence: 99%
“…This pipeline involves clustering and assembly sequences, which are highly compute intensive. The overlapping sequences among the parts of gene sequences are grouped by software, PaCE [4] that is often run in parallel. The results of this clustering process are then fed to the assembly process to generate contigs, which are the consensus sequences derived from multiple mRNA sequences.…”
Section: Introduction (Heading 1)mentioning
confidence: 99%
“…A parallel clustering method developed at Iowa State University [8], PaCE, uses an implementation of suffix trees for sequence comparison. The method is a strict sequence identity match clustering method and performs an NxN alignment, although in parallel, hence offsetting the high costs associated.…”
Section: Introductionmentioning
confidence: 99%