Optimal Completion of Incomplete Gene Trees in Polynomial Time Using OCTAL

DOI10.4230/LIPIcs.WABI.2017.27zbMath1443.92118OpenAlexW2750864835MaRDI QIDQ5111839

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

Publication date: 27 May 2020

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

zbMATH Keywords

gene treesmissing dataphylogenomicscoalescent-based species tree estimation

Mathematics Subject Classification ID

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

Related Items (2)

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

Uses Software

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

Cites Work

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

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