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

Multiple sequence alignment with the Divide-and-Conquer method

J Stoye1

  • 1Research Center for Interdisciplinary Studies on Structure Formation (FSPM), University of Bielefeld, Postfach 10 01 31, D-33501 Bielefeld, Germany. stoye@cs.ucdavis.edu

Gene
|July 21, 1998
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

Correction: Benchmarking tools for the alignment of functional noncoding DNA.

BMC bioinformatics·2004
Same author

QAlign: quality-based multiple alignments with dynamic phylogenetic analysis.

Bioinformatics (Oxford, England)·2003
Same author

Common intervals and sorting by reversals: a marriage of necessity.

Bioinformatics (Oxford, England)·2002
Same author

REPuter: the manifold applications of repeat analysis on a genomic scale.

Nucleic acids research·2001
Same author

An iterative method for faster sum-of-pairs multiple sequence alignment.

Bioinformatics (Oxford, England)·2000
Same author

Contig selection in physical mapping.

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

Constructing regulatory networks of Rubisco post-translational modifications: a novel avenue for engineering environment adaptive plants.

Gene·2026
Same journal

Traumatic brain injury enhances fracture healing by upregulating VNN1 to activate the Wnt/β-catenin signaling pathway.

Gene·2026
Same journal

Single-cell transcriptomics reveals CCL2-mediated macrophage-endothelial cell interactions drive apoptosis in varicose veins.

Gene·2026
Same journal

Development of a gene signature related to phospholipid metabolism for prognosis and therapeutic Prediction in Osteosarcoma: Focus on VAC14.

Gene·2026
Same journal

A pilot single-case longitudinal multi-omics of canine oral melanoma characterizes endogenous mutation patterns and radiotherapy-associated responses.

Gene·2026
Same journal

Genome-wide identification and analysis of GATA genes family in maize reveals involvement of ZmGATA17 in salt stress tolerance.

Gene·2026
See all related articles

A new Divide-and-Conquer Alignment (DCA) algorithm improves simultaneous alignment of multiple protein and nucleic acid sequences. This enhanced method efficiently handles larger sequence families with complex gap penalties.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Multiple sequence alignment is crucial for understanding protein and nucleic acid sequence relationships.
  • Existing algorithms may face limitations in efficiency and scalability for large datasets.

Purpose of the Study:

  • To present an improved Divide-and-Conquer Alignment (DCA) algorithm for simultaneous multiple sequence alignment.
  • To generalize the DCA method for arbitrary gap penalty functions and enhance its practical efficiency.

Main Methods:

  • The study generalizes the previously described Divide-and-Conquer Alignment (DCA) procedure.
  • The algorithm is adapted to handle arbitrary gap penalty functions, including affine linear penalties.
  • Practical efficiency improvements allow alignment of families with over 10 sequences rapidly.

Related Experiment Videos

Main Results:

  • The enhanced DCA algorithm demonstrates improved efficiency for simultaneous multiple sequence alignment.
  • The method successfully aligns larger families of protein and nucleic acid sequences within minutes.
  • Time and memory requirements of the DCA implementation are assessed.

Conclusions:

  • The improved DCA algorithm offers a scalable and efficient solution for multiple sequence alignment.
  • This method is capable of addressing complex, real-world alignment challenges in bioinformatics.
  • The generalized DCA procedure enhances its applicability across diverse biological sequence analysis tasks.