DLS-trees: a model of evolutionary scenarios
From MaRDI portal
Publication:2503308
DOI10.1016/j.tcs.2006.05.019zbMath1097.68053OpenAlexW2067547496WikidataQ61634966 ScholiaQ61634966MaRDI QIDQ2503308
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.019
Related Items (19)
Reconciliation with segmental duplication, transfer, loss and gain ⋮ Complete characterization of incorrect orthology assignments in best match graphs ⋮ Reconciliation of a gene network and species tree ⋮ Gene tree correction for reconciliation and species tree inference: complexity and algorithms ⋮ Mathematical properties of the gene duplication cost ⋮ Gene tree species tree reconciliation with gene conversion ⋮ Inferring incomplete lineage sorting, duplications, transfers and losses with reconciliations ⋮ Beyond evolutionary trees ⋮ Indirect identification of horizontal gene transfer ⋮ Correcting gene trees by leaf insertions: complexity and approximation ⋮ Unnamed Item ⋮ Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models ⋮ Best match graphs and reconciliation of gene trees with species trees ⋮ Bootstrapping Algorithms for Gene Duplication and Speciation Events ⋮ Error Detection and Correction of Gene Trees ⋮ Detecting Locus Acquisition Events in Gene Trees ⋮ Reconciling event-labeled gene trees with MUL-trees and species networks ⋮ MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms ⋮ A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree
Cites Work
This page was built for publication: DLS-trees: a model of evolutionary scenarios
