Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks.

DOI10.4230/LIPICS.WABI.2021.17MaRDI QIDQ6175896zbMATH OpenOpenAlexFDO

Authors Natalia Rutecka, Agnieszka Mykowiecka, Paweł Górecki

Publication date 24 July 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2021/14370/pdf/LIPIcs-WABI-2021-17.pdf/

zbMATH Keywords

deep coalescencegene treeoptimal displayed treephylogenetic networkreticulationspecies tree

Mathematics Subject Classification ID

Dynamic programming (90C39) Computational methods for problems pertaining to biology (92-08) Problems related to evolution (92D15)

Recommendations

• The fine structure of galls in phylogenetic networks
• Deep coalescence reconciliation with unrooted gene trees: linear time algorithms
• Polynomial-time algorithms for phylogenetic inference problems
• Research in Computational Molecular Biology
• Finding a most parsimonious or likely tree in a network with respect to an alignment

Cited in

(1)

• Deep coalescence reconciliation with unrooted gene trees: linear time algorithms

This page was built for publication: Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks.

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