%0 Journal Article
%T Reconciling multiple genes trees via segmental duplications and losses
%A Manuel Lafond
%A Riccardo Dondi
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2019
%R 10.1186/s13015-019-0139-6
%X Note that if G consists of one tree, this definition coincides with the usual one given in the literature (first formally defined in [24]). We say that ¦Á is an LCA-mapping if, for each internal node u ¡Ê V ( G ) with children u 1 , u 2 , ¦Á r ( u ) = L C A S ( ¦Á r ( u 1 ) , ¦Á r ( u 2 ) ) . Note that there may be more than one LCA-mapping, since the S and D events on internal nodes can vary. The number of duplications of ¦Á , denoted by d ( ¦Á ) is the number of nodes u of G such that ¦Á e ( u ) = D . For counting the losses, first define for y ¡Ü x the distance dist(x, y) as the number of arcs on the path from x to y. Then, for every internal node u with children { u 1 , u 2 } , the number of losses associated with u in a reconciliation ¦Á , denoted by l ¦Á ( u ) , is defined as follows
%K Phylogenetics
%K Gene trees
%K Species trees
%K Reconciliation
%K Segmental duplications
%K Fixed-parameter tractability
%K NP-hardness
%K Whole genome duplications
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6425616/