Name
Abstract | ||
|---|---|---|
The minimizing-deep-coalescence (MDC) approach infers a median (species) tree for a given set of gene trees under the deep coalescence cost. This cost accounts for the minimum number of deep coalescences needed to reconcile a gene tree with a species tree where the leaf-genes are mapped to the leaf-species through a function called leaf labeling. In order to better understand the MDC approach we i... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TCBB.2016.2520937 | IEEE/ACM Transactions on Computational Biology and Bioinformatics |
Keywords | Field | DocType |
Vegetation,Labeling,Computational modeling,Phylogeny,Standards,Topology,Biological system modeling | Exact formula,Tree rotation,K-ary tree,Network topology,Exponential tree,Artificial intelligence,Bioinformatics,Coalescence (physics),Machine learning,Mathematics | Journal |
Volume | Issue | ISSN |
14 | 5 | 1545-5963 |
Citations | PageRank | References |
1 | 0.37 | 19 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pawel Górecki | 1 | 112 | 14.26 |
| Jaroslaw Paszek | 2 | 7 | 3.23 |
| Oliver Eulenstein | 3 | 505 | 52.71 |