2002
DOI: 10.1093/bioinformatics/18.suppl_1.s181
|View full text |Cite
|
Sign up to set email alerts
|

Splicing graphs and EST assembly problem

Abstract: Motivation: The traditional approach to annotate alternative splicing is to investigate every splicing variant of the gene in a case-by-case fashion. This approach, while useful, has some serious shortcomings. Recent studies indicate that alternative splicing is more frequent than previously thought and some genes may produce tens of thousands of different transcripts. A list of alternatively spliced variants for such genes would be difficult to build and hard to analyse. Moreover, such a list does not show th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
160
0
1

Year Published

2005
2005
2016
2016

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 190 publications
(162 citation statements)
references
References 23 publications
1
160
0
1
Order By: Relevance
“…Indeed, as discussed later in more detail, 50.4% of the 3Ј reads gave no BLASTx hit, whereas 27.7% of the 5Ј reads gave no hit. As the project continued, we increased the percentage of 3Ј reads to facilitate the clustering and assembly of ESTs into contigs (Heber et al, 2002;Wang et al, 2004).…”
Section: Characterization Of the Total Est Collectionmentioning
confidence: 99%
“…Indeed, as discussed later in more detail, 50.4% of the 3Ј reads gave no BLASTx hit, whereas 27.7% of the 5Ј reads gave no hit. As the project continued, we increased the percentage of 3Ј reads to facilitate the clustering and assembly of ESTs into contigs (Heber et al, 2002;Wang et al, 2004).…”
Section: Characterization Of the Total Est Collectionmentioning
confidence: 99%
“…Capturing the 59R39 directionality of transcription, they naturally all form directed acyclic graphs (DAGs). Going back to [33], matching (parts of) ESTs [22,34,35] have been used as nodes connected by edges representing the EST evidence, in order to cluster them and/or to allow the analysis of AS. Heber and co-workers [35] subsequently collapse (remove) vertices with indegree (i.e., the number of inedges) = outdegree (the number of outedges) = 1.…”
Section: Introductionmentioning
confidence: 99%
“…Going back to [33], matching (parts of) ESTs [22,34,35] have been used as nodes connected by edges representing the EST evidence, in order to cluster them and/or to allow the analysis of AS. Heber and co-workers [35] subsequently collapse (remove) vertices with indegree (i.e., the number of inedges) = outdegree (the number of outedges) = 1. Later on, two works from the same year proposed a graph structure where every vertex corresponds to a splice site and the connecting edges represent the intermediate exon/intron [36,37], labelled according to the mRNA or EST evidence.…”
Section: Introductionmentioning
confidence: 99%
“…Instead of a comprehensive review, we will just name a few results below. To enumerate all possible isoforms, a core ingredient is the splicing graph (Heber et al, 2002;Sammeth et al, 2008a). A predetermined parameter ''dimension'' decides how many transcripts are compared simultaneously.…”
Section: Introductionmentioning
confidence: 99%