Inferring phylogenetic trees using answer set programming

DOI10.1007/S10817-007-9082-1MaRDI QIDQ2467563zbMATH OpenOpenAlexFDO

Authors Daniel Brooks, Esra Erdem, Selim T. Erdoğan, James W. Minett, Don Ringe

Publication date 22 January 2008

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10817-007-9082-1

zbMATH Keywords

Answer set programmingCladisticsPhylogeny

Mathematics Subject Classification ID

Logic programming (68N17) Knowledge representation (68T30) Linguistics (91F20) Problems related to evolution (92D15)

Recommendations

• Optimizing phylogenetic supertrees using answer set programming
• Constructing Camin-Sokal Phylogenies Via Answer Set Programming
• Inferring phylogenetic trees using pseudo-Boolean optimization
• Temporal phylogenetic networks and logic programming
• The complexity of phylogeny constraint satisfaction

Cites work

• Answer set programming and plan generation
• Extending and implementing the stable model semantics
• scientific article; zbMATH DE number 5910656 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1954109 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 5212421 (Why is no real title available?)
• Nested expressions in logic programs
• Temporal phylogenetic networks and logic programming
• The computational complexity of inferring rooted phylogenies by parsimony
• The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
• The Steiner problem in phylogeny is NP-complete
• Tight logic programs
• Weight constraints as nested expressions

Cited in

(15)

• Computing weighted solutions in ASP: representation-based method vs. search-based method
• scientific article; zbMATH DE number 1954109 (Why is no real title available?)
• Achievements in answer set programming
• Optimizing phylogenetic supertrees using answer set programming
• Disjunctive answer set solvers via templates
• Stable-unstable semantics: Beyond NP with normal logic programs
• A logic-based framework leveraging neural networks for studying the evolution of neurological disorders
• scientific article; zbMATH DE number 7455713 (Why is no real title available?)
• scientific article; zbMATH DE number 7455719 (Why is no real title available?)
• Finding similar/diverse solutions in answer set programming
• Constructing Camin-Sokal Phylogenies Via Answer Set Programming
• ASP at work: an ASP implementation of PhyloWS
• Temporal phylogenetic networks and logic programming
• From felicitous models to answer set programming
• The stable model semantics of Datalog with metric temporal operators

Describes a project that uses

Uses Software

• PHYLIP
• Chaff
• PAUP*

This page was built for publication: Inferring phylogenetic trees using answer set programming

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