Evidence map›Paper›PMID 29876842›Full record

ArticleBulletin of mathematical biology2019

Mathematical and Simulation-Based Analysis of the Behavior of Admixed Taxa in the Neighbor-Joining Algorithm.

Jaehee Kim, Filippo Disanto, Naama M Kopelman, Noah A Rosenberg

Abstract read
In one paragraph

Article in Bulletin of mathematical biology, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Deconvolving Phylogenetic Distance Mixtures.bioRxiv : the preprint server for biology · 2026
    Article
  2. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Jaehee KimDepartment of Biology, Stanford University, Stanford, CA, 94305, USA. jk2236@stanford.edu.ORCID http://orcid.org/0000-0002-5210-2004
Filippo DisantoDepartment of Mathematics, University of Pisa, 56126, Pisa, Italy.
Naama M KopelmanDepartment of Computer Science, Faculty of Sciences, Holon Institute of Technology, 58109, Holon, Israel.
Noah A RosenbergDepartment of Biology, Stanford University, Stanford, CA, 94305, USA.

Funding

Mathematical and computational analysis for species tree inferenceR01GM117590 · NIGMS · UNIVERSITY OF ALASKA FAIRBANKS · PI RHODES, JOHN · 2015 to 2018
$1.5M
NIGMS NIH HHS R01 GM117590NIH HHS R01 GM117590
6 · The paper itself

Abstract

The neighbor-joining algorithm for phylogenetic inference (NJ) has been seen to have three specific properties when applied to distance matrices that contain an admixed taxon: (1) antecedence of clustering, in which the admixed taxon agglomerates with one of its source taxa before the two source taxa agglomerate with each other; (2) intermediacy of distances, in which the distance on an inferred NJ tree between an admixed taxon and either of its source taxa is smaller than the distance between the two source taxa; and (3) intermediacy of path lengths, in which the number of edges separating the admixed taxon and either of its source taxa is less than or equal to the number of edges between the source taxa. We examine the behavior of neighbor-joining on distance matrices containing an admixed group, investigating the occurrence of antecedence of clustering, intermediacy of distances, and intermediacy of path lengths. We first mathematically predict the frequency with which the properties are satisfied for a labeled unrooted binary tree selected uniformly at random in the absence of admixture. We then introduce a taxon constructed by a linear admixture of distances from two source taxa, examining three admixture scenarios by simulation: a model in which distance matrices are chosen at random, a model in which an admixed taxon is added to a set of taxa that reflect treelike evolution, and a model that introduces a perturbation of the treelike scenario. In contrast to previous conjectures, we observe that the three properties are sometimes violated by distance matrices that include an admixed taxon. However, we also find that they are satisfied more often than is expected by chance when the distance matrix contains an admixed taxon, especially when evolution among the non-admixed taxa is treelike. The results contribute to a deeper understanding of the nature of evolutionary trees constructed from data that do not necessarily reflect a treelike evolutionary process.

Indexed as

AlgorithmsPhylogenyCluster AnalysisComputational BiologyComputer SimulationEvolution, MolecularMathematical ConceptsModels, GeneticModels, StatisticalProbabilityAdmixtureNeighbor-joiningPhylogeneticsRogue taxon

Identifiers

PMID29876842
PMCPMC7723469

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.