Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL

DOI10.4230/LIPICS.WABI.2017.27zbMATH Open1443.92118OpenAlexW2750864835MaRDI QIDQ5111839FDOQ5111839

Pranjal Vachaspati, Sarah Christensen, Tandy J. Warnow, Erin K. Molloy

Publication date: 27 May 2020

Full work available at URL: http://doi.org/10.4230/LIPIcs.WABI.2017.27

Recommendations

• scientific article; zbMATH DE number 2102787
• A Polynomial-Time Algorithm for Near-Perfect Phylogeny
• Polynomial-time algorithms for phylogenetic inference problems
• Correcting gene trees by leaf insertions: complexity and approximation
• Optimal Completion and Comparison of Incomplete Phylogenetic Trees Under Robinson-Foulds Distance
• scientific article; zbMATH DE number 7205091
• Incomplete directed perfect phylogeny in linear time

zbMATH Keywords

missing dataphylogenomicsgene treescoalescent-based species tree estimation

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Software, source code, etc. for problems pertaining to biology (92-04)

Cites Work

• Comparison of phylogenetic trees
• Likelihood-based tree reconstruction on a concatenation of aligned sequence data sets can be statistically inconsistent
• Split probabilities and species tree inference under the multispecies coalescent model
• Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL

Cited In (2)

• Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL
• QT-GILD: Quartet based gene tree imputation using deep learning improves phylogenomic analyses despite missing data

Uses Software

• SimPhy
• DendroPy
• ASTRAL-II
• INDELible
• ASTRID
• OCTAL

This page was built for publication: Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL

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