Name
Abstract | ||
|---|---|---|
The combinatorial characterization of time consistency and thus biologically feasible reconciliation is an important step towards the inference of gene family histories with horizontal transfer from orthology data, i.e., without presupposed gene and species trees. The fast algorithm to decide time consistency is useful in a broader context because it constitutes an attractive component for all tools that address tree reconciliation problems. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1186/s13015-018-0121-8 | Algorithms for Molecular Biology |
Keywords | Field | DocType |
Tree reconciliation,Horizontal gene transfer,Reconciliation map,Time-consistency,History of gene families | Mathematical structure,Computer science,Time consistency,Time travel,Algorithm,Theoretical computer science,Bioinformatics,Gene family | Journal |
Volume | Issue | ISSN |
13 | 1 | 1748-7188 |
Citations | PageRank | References |
0 | 0.34 | 26 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nikolai Nøjgaard | 1 | 3 | 2.41 |
| Manuela Geiß | 2 | 5 | 1.93 |
| Daniel Merkle | 3 | 364 | 43.93 |
| Peter F. Stadler | 4 | 1839 | 152.96 |
| Nicolas Wieseke | 5 | 114 | 9.34 |
| marc hellmuth | 6 | 148 | 22.80 |