The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
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 the relationships between different transcripts and does not show the overall structure of all transcripts. A better approach would be to represent all splicing variants for a given gene in a way that captures the relationships between different splicing variants. Results: We introduce the notion of the splicing graph that is a natural and convenient representation of all splicing variants. The key difference with the existing approaches is that we abandon the linear (sequence) representation of each transcript and replace it with a graph representation where each transcript corresponds to a path in the graph. We further design an algorithm to assemble EST reads into the splicing graph rather than assembling them into each splicing variant in a case-by-case fashion. Availability: http://www-cse.ucsd.edu/groups/bioinformatics/software.html Contact: sheber@ucsd.edu Keywords: EST assembly; splicing graph; alternative splicing
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
CAP3: A DNA Sequence Assembly Program
Huang, X., & Madan, A. (1999) · Genome Research · doi:10.1101/gr.9.9.868 · Cited by 5,261
Cited by
Oases:robust de novo RNA-seq assembly across the dynamic range of expression levels
Schulz, M. H., Zerbino, D. R., Vingron, M., & Birney, E. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts094 · Cited by 1,424
MapSplice: Accurate mapping of RNA-seq reads for splice junction discovery
Wang, K., Singh, D., Zeng, Z., Coleman, S. J., Huang, Y., Savich, G. L., He, X., Mieczkowski, P., Grimm, S. A., Perou, C. M., et al. (2010) · Nucleic Acids Research · doi:10.1093/nar/gkq622 · Cited by 1,193
Identification of novel transcripts in annotated genomes using RNA-Seq
Roberts, A., Pimentel, H., Trapnell, C., & Pachter, L. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr355 · Cited by 972
What is a gene, post-ENCODE? History and updated definition
Gerstein, M. B., Bruce, C., Rozowsky, J. S., Zheng, D., Du, J., Korbel, J. O., Emanuelsson, O., Zhang, Z. D., Weissman, S., & Snyder, M. (2007) · Genome Research · doi:10.1101/gr.6339607 · Cited by 699
A new view of transcriptome complexity and regulation through the lens of local splicing variations
Vaquero-Garcia, J., Barrera, A., Gazzara, M. R., González-Vallinas, J., Lahens, N. F., Hogenesch, J. B., Lynch, K. W., & Barash, Y. (2016) · eLife · doi:10.7554/elife.11752 · Cited by 488
Metadata
- Authors
- Heber, S., Alekseyev, M., Sze, S.-H., Tang, H., & Pevzner, P. A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-07-01
- Volume
- 18
- Issue
- suppl_1
- Pages
- S181-S188
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2143447881
- Cited by
- 201
- References
- 1
- FWCI
- 2.81
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Splicing graphs and EST assembly problem. https://app.cochat.ai/papers/10.1093/bioinformatics/18.suppl_1.s181
- The paper
- Heber, S., Alekseyev, M., Sze, S.-H., Tang, H., & Pevzner, P. A. (2002). Splicing graphs and EST assembly problem. Bioinformatics. https://doi.org/10.1093/bioinformatics/18.suppl_1.s181
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.