Name
Abstract | ||
|---|---|---|
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 wether a BMG 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-resolvable tree (BRT), which in general is a substantial refinement of the also unique least resolved tree of a BMG. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-74432-8_6 | AlCoB |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Schaller | 1 | 0 | 1.01 |
| Manuela Geiß | 2 | 1 | 1.04 |
| marc hellmuth | 3 | 148 | 22.80 |
| Peter F. Stadler | 4 | 5 | 1.03 |