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 Concept Videos

Microbial Phylogeny01:28

Microbial Phylogeny

Understanding the evolutionary relationships among microorganisms is fundamental to microbial ecology and taxonomy. Phylogenetic trees are essential tools for inferring these relationships, relying primarily on comparative analyses of molecular sequences such as DNA, RNA, or proteins. In microbial studies, these trees typically depict the evolutionary paths of diverse bacterial and archaeal species by mapping genetic differences accumulated over time.Phylogenetic trees are composed of tips,...
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
Phylogenetic Trees03:21

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
Phylogenetic Trees03:21

Phylogenetic Trees

Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Quantifying the difference between phylogenetic diversity and diversity indices.

Journal of mathematical biology·2024
Same author

Recovering normal networks from shortest inter-taxa distance information.

Journal of mathematical biology·2018
Same author

On the information content of discrete phylogenetic characters.

Journal of mathematical biology·2017
Same author

Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks.

Journal of theoretical biology·2017
Same author

On the fixed parameter tractability of agreement-based phylogenetic distances.

Journal of mathematical biology·2016
Same author

Determining phylogenetic networks from inter-taxa distances.

Journal of mathematical biology·2015
Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024
Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024
See all related articles

Related Experiment Video

Updated: May 7, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Accuracy guarantees for phylogeny reconstruction algorithms based on balanced minimum evolution.

Magnus Bordewich1, Radu Mihaescu

  • 1Durham University, Durham.

IEEE/ACM Transactions on Computational Biology and Bioinformatics
|October 5, 2013
PubMed
Summary
This summary is machine-generated.

FastME and GreedyBME algorithms accurately reconstruct phylogenetic trees from distance data when data are quartet consistent. These methods offer improved accuracy and edge reconstruction compared to the Neighbor-Joining (NJ) algorithm.

More Related Videos

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
08:57

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
07:49

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

Published on: August 16, 2017

Related Experiment Videos

Last Updated: May 7, 2026

A Practical Guide to Phylogenetics for Nonexperts
12:00

A Practical Guide to Phylogenetics for Nonexperts

Published on: February 5, 2014

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
08:57

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin

Published on: August 14, 2018

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group
07:49

Creating and Applying a Reference to Facilitate the Discussion and Classification of Proteins in a Diverse Group

Published on: August 16, 2017

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Phylogenetic trees are crucial for understanding evolutionary relationships.
  • Distance-based methods infer trees from pairwise taxon distances.
  • The Neighbor-Joining (NJ) algorithm is a widely used distance-based method.

Purpose of the Study:

  • To evaluate the performance of GreedyBME and FastME algorithms in phylogenetic tree reconstruction.
  • To compare GreedyBME and FastME against the Neighbor-Joining (NJ) algorithm.
  • To provide theoretical support for FastME's suitability in phylogenetics.

Main Methods:

  • Analysis of distance-based phylogenetic algorithms: GreedyBME, FastME, and NJ.
  • Examination of algorithms based on minimizing the balanced minimum evolution score.
  • Theoretical analysis of tree reconstruction accuracy under quartet consistency and distance error.

Main Results:

  • GreedyBME and FastME reconstruct the correct tree if input data are quartet consistent.
  • GreedyBME and FastME guarantee reconstruction of true tree edges of length at least 3ε (edge safety radius 1/3).
  • NJ algorithm's accuracy is not guaranteed by quartet consistency, with an edge safety radius of 1/4.

Conclusions:

  • GreedyBME and FastME are theoretically superior to NJ for distance-based phylogeny reconstruction.
  • FastME demonstrates enhanced accuracy and reliability in reconstructing evolutionary relationships.
  • The study provides strong theoretical backing for using FastME over NJ.