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

SGA: a grammar-based alignment algorithm.

Guangyue Hu1, Shiyi Shen, Jishou Ruan

  • 1College of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071, PR China. huguangyue@gmail.com

Computer Methods and Programs in Biomedicine
|February 3, 2007
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

Development of a Blocking ELISA for the Serological Diagnosis of Getah Virus.

Transboundary and emerging diseases·2026
Same author

Long-term survival after multimodal therapy for advanced hepatocellular carcinoma: a case report.

Frontiers in immunology·2026
Same author

Structural insights into hormone recognition and G-protein coupling of the urotensin-II receptor.

The Journal of biological chemistry·2025
Same author

Improving Modulator Management and Side Effect Screening: A CF Learning Network Innovation Lab.

Pediatric pulmonology·2025
Same author

Cryo-EM structures of GnRHR: Foundations for next-generation therapeutics.

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

Cystic Fibrosis Learning Network Telehealth Innovation Lab During the COVID-19 Pandemic: Impact on Access to Care, Outcomes, and a New CF Care Model.

Pediatric pulmonology·2025
Same journal

A novel Milstein-stochastic epidemiologically-informed neural network for approaching epidemic dynamics: Application to Mpox disease.

Computer methods and programs in biomedicine·2026
Same journal

Accounting for approximation errors using surrogate-based parameter estimation of cardiac mechanics digital twins.

Computer methods and programs in biomedicine·2026
Same journal

Facial iPPG heatmap patterns based on period-aware autoencoder show association with carotid atherosclerosis towards non-contact hemodynamic assessment.

Computer methods and programs in biomedicine·2026
Same journal

Explainable machine learning models predict liver fibrosis risk and outcome in the general population: Development and multi-cohort external validation.

Computer methods and programs in biomedicine·2026
Same journal

Evaluation of surrogate endpoints for survival outcomes using the surrogate package in R.

Computer methods and programs in biomedicine·2026
Same journal

Relative spectral and frication-based descriptors as numerical indicators of place of articulation shifts in fricatives produced by Polish children.

Computer methods and programs in biomedicine·2026
See all related articles

Super Genome Alignment (SGA) offers a faster method for comparing large genomes, crucial for understanding evolution and gene function. This new algorithm significantly speeds up genome analysis with minimal loss in accuracy.

Area of Science:

  • Genomics
  • Bioinformatics
  • Computational Biology

Background:

  • Decreasing genome sequencing costs necessitate efficient large-scale sequence comparison.
  • Understanding evolution and gene function relies heavily on comparative genomics.
  • Existing algorithms like dynamic programming are computationally intensive for large datasets.

Purpose of the Study:

  • To develop a novel, rapid genome alignment method for large-scale genomic data.
  • To improve upon the speed of existing alignment algorithms while maintaining high accuracy.
  • To introduce Super Genome Alignment (SGA) as a tool for advancing biological understanding.

Main Methods:

  • Proposed Super Genome Alignment (SGA), a grammar-based algorithm.
  • Applied Yang-Keiffer coding theory to the alignment process.

Related Experiment Videos

  • Utilized Super Pairwise Alignment (SPA) principles for computational efficiency.

    • Main Results:

    • SGA demonstrates computational complexity similar to its predecessor, SPA.
    • Tested extensively on microbial and eukaryotic genome pairs.
    • Achieved significant speed improvements over BLASTZ, ranging from one to two orders of magnitude.
    • Maintained high alignment accuracy, with an average loss of only 1% similarity.

    Conclusions:

    • SGA is a highly efficient algorithm for large-scale genome alignment.
    • The method offers a substantial speed advantage over existing tools like BLASTZ.
    • SGA facilitates deeper insights into evolutionary relationships and gene functions through rapid comparative genomics.