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 maximum-likelihood phylogeny inference using nucleotide sequence data

P O Lewis1

  • 1Department of Biology, University of New Mexico, Albuquerque 87131-1091, USA. lewisp@unm.edu

Molecular Biology and Evolution
|March 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

Successful stepdown treatment of pulmonary histoplasmosis with thrice-weekly liposomal amphotericin B in a hospital-associated, outpatient infusion centre: A case report.

Journal of clinical pharmacy and therapeutics·2017
Same author

Multiple-population versus hierarchical conifer breeding programs: a comparison of genetic diversity levels.

TAG. Theoretical and applied genetics. Theoretische und angewandte Genetik·2013
Same author

A likelihood approach to estimating phylogeny from discrete morphological character data.

Systematic biology·2002
Same author

Bias in phylogenetic estimation and its relevance to the choice between parsimony and likelihood methods.

Systematic biology·2002
Same author

Effects of nucleotide composition bias on the success of the parsimony criterion in phylogenetic inference.

Molecular biology and evolution·2001
Same author

Success of maximum likelihood phylogeny inference in the four-taxon case.

Molecular biology and evolution·1995

Phylogenetic tree reconstruction is computationally intensive. A novel genetic algorithm significantly speeds up maximum likelihood phylogenetic inference, reducing computational effort by 94% for large datasets.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Evolutionary Biology

Background:

  • Phylogeny reconstruction is computationally challenging due to the vast number of possible tree topologies.
  • Existing methods like neighbor-joining and heuristic searches, while faster, can still be slow, especially with maximum likelihood criteria.
  • Large datasets with many taxa exacerbate these computational demands.

Purpose of the Study:

  • To introduce a novel heuristic search approach for phylogenetic inference.
  • To significantly reduce the computational time required for maximum likelihood phylogenetic analysis.
  • To demonstrate the efficacy of genetic algorithms in phylogenetic tree reconstruction.

Main Methods:

  • A genetic algorithm was employed as a heuristic search strategy for phylogenetic inference.

Related Experiment Videos

  • Phylogenetic trees served as individuals in a simulated natural selection process.
  • Reproduction was based on the likelihood scores of individual trees, favoring higher likelihood solutions.

    • Main Results:

    • The genetic algorithm approach drastically reduced computational time for maximum likelihood phylogenetic inference.
    • For a dataset of 55 green plant taxa using rbcL sequence data, the genetic algorithm required only 6% of the computational effort of a conventional heuristic search (TBR).
    • The genetic algorithm successfully obtained the same maximum likelihood topology as the conventional method.

    Conclusions:

    • Genetic algorithms offer a powerful and efficient alternative for heuristic searching in phylogenetic inference.
    • This method is particularly beneficial for large datasets where computational time is a major constraint.
    • The approach accelerates maximum likelihood phylogenetic analysis, making it more feasible for complex evolutionary studies.