Evidence map›Paper›PMID 28177699›Full record

ArticleJournal of computational biology : a journal of computational molecular cell biology2017

Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions.

Damian Bogdanowicz, Krzysztof Giaro

Abstract read
In one paragraph

Article in Journal of computational biology : a journal of computational molecular cell biology, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing 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

5 citing papers in PubMed.

  1. Article
  2. Asymmetric Cluster-Based Measures for Comparative Phylogenetics.Journal of computational biology : a journal of computational molecular cell biology · 2024
    Article
  3. Article
  4. Article
  5. 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

2 authors.

Damian BogdanowiczDepartment of Algorithms and System Modeling, Gdansk University of Technology , Gdansk, Poland .
Krzysztof GiaroDepartment of Algorithms and System Modeling, Gdansk University of Technology , Gdansk, Poland .

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Ability to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in the literature, the most commonly used seems to be the Robinson-Foulds distance. In this article, we define a new metric for rooted trees-the Matching Pair (MP) distance. The MP metric uses the concept of the minimum-weight perfect matching in a complete bipartite graph constructed from partitions of all pairs of leaves of the compared phylogenetic trees. We analyze the properties of the MP metric and present computational experiments showing its potential applicability in tasks related to finding the HGT events.

Indexed as

PhylogenyAlgorithmsComputational BiologyGene Transfer, HorizontalModels, Geneticmatching pair distanceminimum-weight perfect matchingphylogenetic tree comparisonphylogenetic tree metric

Identifiers

PMID28177699
PMCPMC5421509

What OpenQuestion holds

Textmetadata
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.