• Home
  • Search
  • Computing nearest neighbour interchange distances between ranked phylogenetic trees
  • Cite Icon26
  • https://doi.org/10.1007/s00285-021-01567-5Copy DOI Icon

Computing nearest neighbour interchange distances between ranked phylogenetic trees

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Many popular algorithms for searching the space of leaf-labelled (phylogenetic) trees are based on tree rearrangement operations. Under any such operation, the problem is reduced to searching a graph where vertices are trees and (undirected) edges are given by pairs of trees connected by one rearrangement operation (sometimes called a move). Most popular are the classical nearest neighbour interchange, subtree prune and regraft, and tree bisection and reconnection moves. The problem of computing distances, however, is {mathbf {N}}{mathbf {P}}-hard in each of these graphs, making tree inference and comparison algorithms challenging to design in practice. Although ranked phylogenetic trees are one of the central objects of interest in applications such as cancer research, immunology, and epidemiology, the computational complexity of the shortest path problem for these trees remained unsolved for decades. In this paper, we settle this problem for the ranked nearest neighbour interchange operation by establishing that the complexity depends on the weight difference between the two types of tree rearrangements (rank moves and edge moves), and varies from quadratic, which is the lowest possible complexity for this problem, to {mathbf {N}}{mathbf {P}}-hard, which is the highest. In particular, our result provides the first example of a phylogenetic tree rearrangement operation for which shortest paths, and hence the distance, can be computed efficiently. Specifically, our algorithm scales to trees with tens of thousands of leaves (and likely hundreds of thousands if implemented efficiently).

Loading PDF

Similar Papers
  • Research Article
  • Citations17

The Prevalence of Multifurcations in Tree-space and Their Implications for Tree-search

  • Jun 28, 2010
  • Molecular Biology and Evolution
  • Simon Whelan +1
  • Research Article
  • Citations7

A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces

  • Oct 29, 2013
  • Statistics & Probability Letters
  • David A Spade +2
  • PDF
  • Research Article
  • Citations20

Consequences of Common Topological Rearrangements for Partition Trees in Phylogenomic Inference

  • Oct 08, 2015
  • Journal of Computational Biology
  • Olga Chernomor +2
  • Research Article
  • Citations5

Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts

  • Jan 01, 2016
  • SIAM Journal on Discrete Mathematics
  • J V De Jong +2
  • Research Article
  • Citations532

Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle.

  • Oct 01, 2002
  • Journal of Computational Biology
  • Richard Desper +1
  • Book Chapter
  • Citations2

An Enhanced Algorithm for Reconstructing a Phylogenetic Tree Based on the Tree Rearrangement and Maximum Likelihood Method

  • Jan 01, 2015
  • Sun-Yuan Hsieh +5
  • Research Article

Heuristics for unrooted, unranked, and ranked anomaly zones under birth-death models

  • Apr 06, 2021
  • Molecular Phylogenetics and Evolution
  • Anastasiia Kim +1
  • Research Article
  • Citations2

Characterizing Local Optima for Maximum Parsimony.

  • May 01, 2016
  • Bulletin of Mathematical Biology
  • Ellen Urheim +2
  • Research Article
  • Citations53

Progressive Tree Neighborhood applied to the Maximum Parsimony Problem

  • Jan 01, 2008
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • A Goeffon +2
  • Research Article
  • Citations180

Protein co-evolution, co-adaptation and interactions

  • Sep 25, 2008
  • The EMBO Journal
  • Florencio Pazos +1
  • Research Article

The AACR Journals: Advancing Progress Toward the AACR's 115-Year Mission.

  • Nov 02, 2022
  • Cancer epidemiology, biomarkers & prevention : a publication of the American Association for Cancer Research, cosponsored by the American Society of Preventive Oncology
  • Kenneth C Anderson +14
  • Research Article

Transcriptional Regulatory Networks across Species

  • Jan 01, 2011
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne)
  • Xiuwei Zhang
  • Research Article
  • Citations3

Science, the UICC and global cancer control.

  • Mar 15, 2004
  • International journal of cancer
  • John A Wyke
  • Research Article
  • Citations29

Evaluating Undirected Positional Congruence of Individual Taxa Between Two Estimates of the Phylogenetic Tree for a Group of Taxa

  • Jun 01, 1992
  • Systematic Biology
  • G F Estabrook
  • Research Article
  • Citations14

Reassortment Networks for Investigating the Evolution of Segmented Viruses

  • Apr 01, 2010
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • Shahid H Bokhari +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.