Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Splicing graphs and EST assembly problem.

Steffen Heber1, Max Alekseyev, Sing-Hoi Sze

  • 1Department of Computer Science & Engineering, University of California, San Diego, La Jolla, CA, 92093-0114, USA. sheber@ucsd.edu

Bioinformatics (Oxford, England)
|August 10, 2002
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

MGA: a tool for haplotype-mixed assembly of long and accurate reads.

Genome biology·2026
Same author

Cross-chemical and cross-species toxicity prediction: benchmarking and a novel 3D-structure-based deep learning model.

Environmental toxicology and chemistry·2026
Same author

AKI-twinX: explainable organ structured digital twin for sepsis AKI trajectory forecasting.

medRxiv : the preprint server for health sciences·2026
Same author

Comprehensive top-down mass spectral repository enables pan-dataset analysis and top-down spectral prediction.

bioRxiv : the preprint server for biology·2026
Same author

Recruitment of bifunctional regulator thermospermine to methylated ribosomes directs xylem fate.

Science (New York, N.Y.)·2026
Same author

FIDDLE: a deep learning method for chemical formulas prediction from tandem mass spectra.

Nature communications·2025
Same journal

MCFST: Spatial domain identification method based on multi-view graph convolutional network and graph fusion network.

Bioinformatics (Oxford, England)·2026
Same journal

SpaBiT: Enhancing Spatial Transcriptomics Resolution via Bidirectional Attention Transformers.

Bioinformatics (Oxford, England)·2026
Same journal

EDEL: Enhancing Dense Retrievers for Curation of Biomedical Knowledge Bases.

Bioinformatics (Oxford, England)·2026
Same journal

Informative Relational Learning for Adverse Reaction Prediction with Enhanced Generalization to Novel Drugs.

Bioinformatics (Oxford, England)·2026
Same journal

An interpretable deep learning framework uncovers features governing CRISPR-Cas9 genome-editing efficiency.

Bioinformatics (Oxford, England)·2026
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
See all related articles

Annotating alternative splicing variants is challenging due to their sheer number. We introduce splicing graphs to represent all variants and their relationships, simplifying analysis and assembly of expressed sequence tag (EST) reads.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Molecular Biology

Background:

  • Traditional alternative splicing annotation is gene-by-gene, which is inefficient for genes with numerous transcripts.
  • The complexity of alternative splicing necessitates a more integrated representation of all splicing variants.
  • Existing methods struggle to capture relationships between different transcripts.

Purpose of the Study:

  • To develop a novel method for representing and analyzing alternative splicing variants.
  • To overcome the limitations of linear transcript representation in alternative splicing annotation.
  • To facilitate the analysis of complex gene structures with numerous splicing variants.

Main Methods:

  • Introduction of the 'splicing graph' concept for representing alternative splicing.

Related Experiment Videos

  • Shifting from linear transcript representation to a graph-based model.
  • Development of an algorithm for assembling expressed sequence tag (EST) reads into splicing graphs.

    • Main Results:

    • Splicing graphs provide a unified representation of all splicing variants for a gene.
    • Each transcript is represented as a path within the splicing graph.
    • The new algorithm enables direct assembly of EST reads into splicing graphs, bypassing individual variant assembly.

    Conclusions:

    • Splicing graphs offer a more comprehensive and relationship-aware approach to alternative splicing annotation.
    • This graph-based representation simplifies the analysis of complex alternative splicing patterns.
    • The EST assembly algorithm streamlines the process of reconstructing splicing variants.