.png){kind=icon}
Return
Best Match Graphs With Binary Trees
.png){kind=icon}
OA
AI
DOI：10.1109/TCBB.2022.3143870.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Best match graphs (BMG) are a key intermediate in graph-based orthology detection and contain a large amount of information on the gene tree. We provide a near-cubic algorithm to determine whether a BMG is binary-explainable, i.e., whether it can be explained by a fully resolved gene tree and, if so, to construct such a tree. Moreover, we show that all such binary trees are refinements of the unique binary-refinable tree (BRT), which in general is a substantial refinement of the also unique least resolved tree of a BMG. Finally, we show that the problem of editing an arbitrary vertex-colored graph to a binary-explainable BMG is NP-complete and provide an integer linear program formulation for this task.
Keywords:
Best match graphs
binary trees
rooted triple consistency
polynomial-time algorithm
NP-hardness
integer linear program
Journal
I
IF:
3.4
Papers:
3.3K
Citations:
6.4K
Organization
Cited Papers
ShareSaveShareSaveNeuroprotection of neurotrophin-3 against focal cerebral ischemia/reperfusion injury is regulated by hypoxia-responsive element in rats.png)
Neuroscience
NeuroscienceIF0
PREAI
ShareSaveAdaptation of the mechanisms controlling gastric motility following chronic vagotomy in the ferret
OAAI
OAAIShareSaveProgress in quickly finding orthologs as reciprocal best hits: comparing blast, last, diamond and MMseqs2BMC GENOMICSOAAI
BMC GENOMICSIF3.7
OAAIShareSaveShareSaveHuman Cardiac-Mesenchymal Stem Cell-Like Cells, a Novel Cell Population with Therapeutic PotentialOAAI
OAAIShareSave
View more