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

An Eulerian path approach to global multiple alignment for DNA sequences.

Yu Zhang1, Michael S Waterman

  • 1Department of Mathematics, University of Southern California, 1042 W. 36th Place (DRB 289), Los Angeles, CA 90089-1113, USA. yuzhang@usc.edu

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|February 26, 2004
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

RNA Secondary Structures with Given Motif Specification: Combinatorics and Algorithms.

Bulletin of mathematical biology·2023
Same author

Levenshtein Distance, Sequence Comparison and Biological Database Search.

IEEE transactions on information theory·2021
Same author

Multiscale Feedback Loops in SARS-CoV-2 Viral Evolution.

Journal of computational biology : a journal of computational molecular cell biology·2020
Same author

Benchmarking of alignment-free sequence comparison methods.

Genome biology·2019
Same author

A new statistic for efficient detection of repetitive sequences.

Bioinformatics (Oxford, England)·2019
Same author

Generalized correlation measure using count statistics for gene expression data with ordered samples.

Bioinformatics (Oxford, England)·2017
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 presents a novel Eulerian path algorithm for multiple sequence alignment, achieving near-linear computational speed. This breakthrough enables rapid, accurate alignment of thousands of long genome sequences.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • The increasing volume of genome sequence data necessitates efficient multiple sequence alignment methods.
  • Existing heuristic algorithms face challenges in speed and alignment quality for large datasets.

Purpose of the Study:

  • To introduce a novel algorithm for global multiple sequence alignment of DNA sequences.
  • To develop a method with near-linear computational complexity relative to the total sequence size.

Main Methods:

  • Adapted the Eulerian method from DNA fragment assembly, utilizing de Bruijn graphs.
  • Transformed the multiple sequence alignment problem into a Eulerian path problem.
  • Developed and implemented a new algorithm based on this graph-theoretical approach.

Related Experiment Videos

Main Results:

  • Achieved near-linear computational speed, significantly outperforming existing methods.
  • Successfully aligned 500 simulated sequences (average 500 bases, 70% identity) in under three minutes on a personal computer.
  • Demonstrated satisfactory alignment quality on simulated and real Arabidopsis sequencing data.

Conclusions:

  • The novel Eulerian path-based algorithm enables accurate and simultaneous alignment of thousands of long sequences efficiently.
  • This method offers a significant advancement for large-scale genomic data analysis.
  • Facilitates timely and precise multiple sequence alignment, crucial for various genomic applications.