Inferring phylogenetic trees using pseudo-Boolean optimization

DOI10.3233/AIC-140592MaRDI QIDQ2811226zbMATH OpenOpenAlexFDO

Authors Miguel Miranda, Inês Lynce, Vasco Manquinho

Publication date 10 June 2016

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-140592

zbMATH Keywords

maximum compatibilityphylogenetic inferencepseudo-Boolean optimization

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean programming (90C09) Problems related to evolution (92D15)

Recommendations

• scientific article; zbMATH DE number 1303534
• Algorithms for phylogeny reconstruction in a new mathematical model
• Haplotype inference with pseudo-Boolean optimization
• Combinatorial optimization solutions for the maximum quartet consistency problem
• Minimizing phylogenetic number to find good evolutionary trees

Cited in

(3)

• Inferring phylogenetic trees using answer set programming
• Combinatorial optimization solutions for the maximum quartet consistency problem
• Nonbifurcating Phylogenetic Tree Inference via the Adaptive LASSO

This page was built for publication: Inferring phylogenetic trees using pseudo-Boolean optimization

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