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

Las Vegas algorithms for gene recognition: suboptimal and error-tolerant spliced alignment

S H Sze1, P A Pevzner

  • 1Department of Computer Science, University of Southern California, Los Angeles 90089-1113, USA. ssze@hto.usc.edu

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|October 1, 1997
PubMed
Summary

This study introduces a novel algorithm for gene recognition, improving accuracy for human gene identification. The new method aims for 100% accuracy, reducing the need for experimental verification in large-scale sequencing.

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

Microinversions in mammalian evolution.

Proceedings of the National Academy of Sciences of the United States of America·2006
Same author

Age-related changes in human crystallins determined from comparative analysis of post-translational modifications in young and aged lens: does deamidation contribute to crystallin insolubility?

Journal of proteome research·2006
Same author

Finding motifs in the twilight zone.

Bioinformatics (Oxford, England)·2002
Same author

Subtle motifs: defining the limits of motif finding algorithms.

Bioinformatics (Oxford, England)·2002
Same author

Finding weak motifs in DNA sequences.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2002
Same author

Assembling puzzles from preassembled blocks.

Genome research·2001

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Current gene recognition methods, like spliced alignment, achieve 99% accuracy for human genes with related mammalian proteins.
  • This accuracy is insufficient for automated large-scale sequencing annotation, necessitating experimental validation.
  • 100% accurate gene predictions could significantly decrease experimental efforts.

Purpose of the Study:

  • To develop an algorithm for highly accurate exon assembly prediction.
  • To provide predictions with sufficient accuracy for automated sequence annotation.
  • To identify cases where predictions are insufficient, alerting researchers to required experimental verification.

Main Methods:

  • Investigating suboptimal and error-tolerant spliced alignment problems.

Related Experiment Videos

  • Developing a novel algorithm for gene recognition based on these studies.

    • Main Results:

    • The developed algorithm achieves 100% accurate human gene recognition in 37% of cases when a related mammalian protein is available.
    • The algorithm successfully predicts at least one exon with 100% accuracy in 52% of genes.
    • This represents a significant advancement over existing 99% accurate methods.

    Conclusions:

    • The developed algorithm shows promise for improving the accuracy of gene recognition.
    • It offers a potential reduction in experimental work for gene identification in large-scale projects.
    • Further development may lead to algorithms with accuracy sufficient for automated sequence annotation.