Efficient non-binary gene tree resolution with weighted reconciliation cost

DOI10.4230/LIPICS.CPM.2016.14MaRDI QIDQ5369549zbMATH OpenOpenAlexFDO

Authors Manuel Lafond, Emmanuel Noutahi, Nadia El-Mabrouk

Publication date 17 October 2017

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2016/6090/pdf/LIPIcs-CPM-2016-14.pdf/

zbMATH Keywords

gene treephylogenypolytomyreconciliationresolutionweighted cost

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Genetics and epigenetics (92D10) Problems related to evolution (92D15)

Recommendations

• Reconciling Gene Trees with Apparent Polytomies
• Reconciliation with nonbinary gene trees revisited
• A linear-time algorithm for reconciliation of non-binary gene tree and binary species tree
• Reconciliation feasibility of non-binary gene trees under a duplication-loss-coalescence model
• Reconciling multiple genes trees via segmental duplications and losses

Cited in

(2)

• Reconciling Gene Trees with Apparent Polytomies
• A general framework for gene tree correction based on duplication-loss reconciliation

This page was built for publication: Efficient non-binary gene tree resolution with weighted reconciliation cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5369549)