Reconciling Gene Trees with Apparent Polytomies

DOI10.1007/11809678_26zbMath1162.92314OpenAlexW2123169853MaRDI QIDQ3591344

Oliver Eulenstein, Wen-Chieh Chang

Publication date: 10 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1184&context=cs_techreports

Mathematics Subject Classification ID

Problems related to evolution (92D15) Genetics and epigenetics (92D10) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08) Computer aspects of numerical algorithms (65Y99)

Related Items (7)

Complete characterization of incorrect orthology assignments in best match graphs ⋮ Complexity insights of the minimum duplication problem ⋮ Correcting gene tree by removal and modification: tractability and approximability ⋮ Beyond evolutionary trees ⋮ Correcting gene trees by leaf insertions: complexity and approximation ⋮ Error Detection and Correction of Gene Trees ⋮ A Linear-Time Algorithm for Reconciliation of Non-binary Gene Tree and Binary Species Tree

This page was built for publication: Reconciling Gene Trees with Apparent Polytomies