ArticleJournal of mathematical biology2019
Best match graphs.
Article in Journal of mathematical biology, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. An erratum has been issued. Cited by 12 papers.
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.
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.
Who cites it
12 citing papers in PubMed.
- REvolutionH-tl 2.0: A fast and robust tool for decoding evolutionary gene histories.PLoS computational biology · 2026Article
- Orthology and near-cographs in the context of phylogenetic networks.Algorithms for molecular biology : AMB · 2025Article
- The Theory of Gene Family Histories.Methods in molecular biology (Clifton, N.J.) · 2024Article
- A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set.Algorithms for molecular biology : AMB · 2021Article
- Heuristic algorithms for best match graph editing.Algorithms for molecular biology : AMB · 2021Article
- Indirect identification of horizontal gene transfer.Journal of mathematical biology · 2021Article
- Corrigendum to "Best match graphs".Journal of mathematical biology · 2021Article
- Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs.Journal of mathematical biology · 2021Article
- Best match graphs and reconciliation of gene trees with species trees.Journal of mathematical biology · 2020Article
- Reciprocal best match graphs.Journal of mathematical biology · 2020Article
- Reconstruction of time-consistent species trees.Algorithms for molecular biology : AMB · 2020Article
- From pairs of most similar sequences to phylogenetic best matches.Algorithms for molecular biology : AMB · 2020Article
Corrections and comments
- Erratum issued
Authors and funding
9 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Best match graphs arise naturally as the first processing intermediate in algorithms for orthology detection. Let T be a phylogenetic (gene) tree T and [Formula: see text] an assignment of leaves of T to species. The best match graph [Formula: see text] is a digraph that contains an arc from x to y if the genes x and y reside in different species and y is one of possibly many (evolutionary) closest relatives of x compared to all other genes contained in the species [Formula: see text]. Here, we characterize best match graphs and show that it can be decided in cubic time and quadratic space whether [Formula: see text] derived from a tree in this manner. If the answer is affirmative, there is a unique least resolved tree that explains [Formula: see text], which can also be constructed in cubic time.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.