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

Assembling genes from predicted exons in linear time with dynamic programming.

R Guigó1

  • 1Institut Municipal d'Investigació Mèdica, Departament d'Estadística, Universitat de Barcelona, Spain. rguigo@imim.es

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|March 11, 1999
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

Improving data and knowledge management to better integrate health care and research.

Journal of internal medicine·2013
Same author

SPIn: model selection for phylogenetic mixtures via linear invariants.

Molecular biology and evolution·2011
Same author

Long noncoding RNAs as enhancers of gene expression.

Cold Spring Harbor symposia on quantitative biology·2011
Same author

Selenoprofiles: profile-based scanning of eukaryotic genome sequences for selenoprotein genes.

Bioinformatics (Oxford, England)·2010
Same author

Exon structure conservation despite low sequence similarity: a relic of dramatic events in evolution?

The EMBO journal·2001
Same author

SGP-1: prediction and validation of homologous genes based on sequence alignments.

Genome research·2001
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

This study introduces a novel, linear-time algorithm for gene structure prediction, significantly improving upon existing quadratic methods. The new approach efficiently identifies the highest-scoring gene by storing and updating compatible exon combinations, enhancing genomic sequence analysis.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Current gene structure prediction programs often decouple exon prediction from gene assembly.
  • Existing algorithms for identifying the highest-scoring gene run in time proportional to the square of the number of predicted exons.

Purpose of the Study:

  • To present a novel algorithm for gene structure prediction with a running time that grows linearly with the number of predicted exons.
  • To improve the efficiency of identifying the most likely gene encoded by a DNA sequence.

Main Methods:

  • Developed a new algorithm that stores and updates the highest-scoring gene ending at each exon.
  • Scans the set of predicted exons simultaneously by increasing acceptor and donor positions.
  • The algorithm does not assume an underlying gene structure model, relying on an externally defined Gene Model.

Related Experiment Videos

Main Results:

  • The new algorithm achieves a linear running time complexity with respect to the number of predicted exons.
  • This represents a significant improvement over existing quadratic time algorithms.
  • The approach allows for flexibility in defining valid gene structures.

Conclusions:

  • The presented algorithm offers a more efficient method for gene structure prediction in higher eukaryotic genomic sequences.
  • The flexible Gene Model allows for complex predictions, including multiple genes and consideration of non-coding features.
  • This advancement can accelerate genomic sequence analysis and gene identification.