Reconciling Gene Trees with Apparent Polytomies
DOI10.1007/11809678_26zbMATH Open1162.92314OpenAlexW2123169853MaRDI QIDQ3591344FDOQ3591344
Authors: Wen-Chieh Chang, Oliver Eulenstein 
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
Recommendations
Complexity and performance of numerical algorithms (65Y20) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Computer aspects of numerical algorithms (65Y99) Computational methods for problems pertaining to biology (92-08)
Cited In (14)
- Error detection and correction of gene trees
- Complexity insights of the minimum duplication problem
- Title not available (Why is that?)
- Correcting gene trees by leaf insertions: complexity and approximation
- Reconciling multiple genes trees via segmental duplications and losses
- Complete characterization of incorrect orthology assignments in best match graphs
- Efficient non-binary gene tree resolution with weighted reconciliation cost
- A general framework for gene tree correction based on duplication-loss reconciliation
- Title not available (Why is that?)
- A linear-time algorithm for reconciliation of non-binary gene tree and binary species tree
- Correcting gene tree by removal and modification: tractability and approximability
- Title not available (Why is that?)
- Beyond evolutionary trees
- Reconciling event-labeled gene trees with MUL-trees and species networks
This page was built for publication: Reconciling Gene Trees with Apparent Polytomies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591344)
