%0 Journal Article
%T Time-consistent reconciliation maps and forbidden time travel
%A Daniel Merkle
%A Manuela Gei£ż
%A Nicolas Wieseke
%A Nikolai N£żjgaard
%A Peter F. Stadler
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2018
%R 10.1186/s13015-018-0121-8
%X In the absence of horizontal gene transfer it is possible to reconstruct the history of gene families from empirically determined orthology relations, which are equivalent to event-labeled gene trees. Knowledge of the event labels considerably simplifies the problem of reconciling a gene tree T with a species trees S, relative to the reconciliation problem without prior knowledge of the event types. It is well-known that optimal reconciliations in the unlabeled case may violate time-consistency and thus are not biologically feasible. Here we investigate the mathematical structure of the event labeled reconciliation problem with horizontal transfer
%K Tree reconciliation
%K Horizontal gene transfer
%K Reconciliation map
%K Time-consistency
%K History of gene families
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5800358/