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

A genetic algorithm for multiple molecular sequence alignment

C Zhang1, A K Wong

  • 1Department of Systems Design Engineering, University of Waterloo, Ontario, Canada. czhang@watnow.uwaterloo.ca

Computer Applications in the Biosciences : CABIOS
|February 26, 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

A comparison of peripheral imaging technologies for bone and muscle quantification: a technical review of image acquisition.

Journal of musculoskeletal & neuronal interactions·2016
Same author

A de novo mutation in KIT causes white spotting in a subpopulation of German Shepherd dogs.

Animal genetics·2012
Same author

PFS Clustering Method.

IEEE transactions on pattern analysis and machine intelligence·2011
Same author

DECA: A Discrete-Valued Data Clustering Algorithm.

IEEE transactions on pattern analysis and machine intelligence·2011
Same author

Random graphs: structural-contextual dichotomy.

IEEE transactions on pattern analysis and machine intelligence·2011
Same author

Entropy and distance of random graphs with application to structural pattern recognition.

IEEE transactions on pattern analysis and machine intelligence·2011
Same journal

DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment.

Computer applications in the biosciences : CABIOS·1998
Same journal

Two applications to facilitate the viewing of database search result files on the Macintosh.

Computer applications in the biosciences : CABIOS·1998
Same journal

BioWish: a molecular biology command extension to Tcl/Tk.

Computer applications in the biosciences : CABIOS·1998
Same journal

The Sequence Alerting Server--a new WEB server.

Computer applications in the biosciences : CABIOS·1998
Same journal

A software tool for the analysis of mass spectrometric disulfide mapping experiments.

Computer applications in the biosciences : CABIOS·1998
Same journal

SAMBA: hardware accelerator for biological sequence comparison.

Computer applications in the biosciences : CABIOS·1998
See all related articles

This study introduces a novel genetic algorithm for multiple molecular sequence alignment, significantly reducing computational complexity. The new method achieves comparable alignment quality with drastically lower computing times compared to traditional techniques.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Genomics

Background:

  • Multiple molecular sequence alignment is a critical yet computationally intensive task in bioinformatics.
  • Existing alignment techniques often suffer from high computational complexity, limiting their widespread application.
  • There is a need for more efficient methods for multiple sequence alignment.

Purpose of the Study:

  • To develop a novel and efficient technique for multiple molecular sequence alignment.
  • To address the computational challenges associated with current alignment methods.
  • To improve the accessibility and applicability of multiple sequence alignment tools.

Main Methods:

  • The study employs genetic algorithms, which are stochastic search methods known for efficiency and robustness.

Related Experiment Videos

  • The multiple sequence alignment problem is framed as a search for optimal solutions within an 'alignment space'.
  • A C program implementing the genetic algorithm-based technique has been developed.

    • Main Results:

    • Experimental results demonstrate that the new technique is two to three orders of magnitude faster than pairwise dynamic programming methods.
    • The alignment quality achieved by the genetic algorithm approach is comparable to existing methods.
    • The developed C program is available upon request.

    Conclusions:

    • Genetic algorithms offer an efficient and effective approach to multiple molecular sequence alignment.
    • The new technique significantly reduces computational time without compromising alignment accuracy.
    • This advancement has the potential to broaden the use of multiple sequence alignment in computational biology.