Related Experiment Video
Updated: May 22, 2026

Using Phylogenetic Analysis to Investigate Eukaryotic Gene Origin
Published on: August 14, 2018
A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree
Tanja Stadler1, James H Degnan
1Institute of Integrative Biology, Universitätsstrasse 16, 8092, Zürich, Switzerland. tanja.stadler@env.ethz.ch.
This study introduces a new polynomial-time algorithm for calculating gene tree probabilities, addressing computational challenges in evolutionary biology. This method aids in more accurately reconstructing ancestral species relationships from gene data.
Area of Science:
- Evolutionary biology
- Computational phylogenetics
Background:
- Gene trees can differ from species trees due to incomplete lineage sorting.
- Current methods for calculating gene tree probabilities are computationally intensive, requiring exponential time.
Purpose of the Study:
- To develop a more efficient algorithm for calculating gene tree probabilities.
- To address the computational complexity of inferring species trees from gene trees.
Main Methods:
- Developed a polynomial-time algorithm to compute the probability of a ranked gene tree topology for a given species tree.
- Ranked tree topology involves ordered internal vertices.
Main Results:
- The new algorithm calculates the probability of ranked gene tree topologies in polynomial time.
- The computational complexity for gene tree topologies with an exponential number of rankings remains an open question.
Conclusions:
- Polynomial-time algorithms for ranked gene tree probabilities can advance species tree inference.
- This may lead to more accurate reconstructions of ancestral species relationships.
Related Concept Videos
Evolutionary Relationships through Genome Comparisons
Phylogenetic Trees
Phylogenetic Trees
Gene Evolution - Fast or Slow?
In contrast, regions which code...
Gene Evolution - Fast or Slow?
In contrast, regions which code...
Microbial Phylogeny

