Optimizing phylogenetic supertrees using answer set programming
From MaRDI portal
Publication:4593001
DOI10.1017/S1471068415000265zbMath1379.92038arXiv1507.05272MaRDI QIDQ4593001
Laura Säilä, Laura Koponen, Emilia Oikarinen, Tomi Janhunen
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.05272
Related Items (8)
Stable-unstable semantics: Beyond NP with normal logic programs ⋮ Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) ⋮ Partial Compilation of ASP Programs ⋮ Unnamed Item ⋮ Debugging Non-ground ASP Programs: Technique and Graphical Tools ⋮ The Seventh Answer Set Programming Competition: Design and Results ⋮ The External Interface for Extending WASP ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New results on optimizing rooted triplets consistency
- The computational complexity of inferring rooted phylogenies by parsimony
- The Steiner problem in phylogeny is NP-complete
- A supertree method for rooted trees
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Inferring phylogenetic trees using answer set programming
- Improving the Normalization of Weight Rules in Answer Set Programs
- Open-WBO: A Modular MaxSAT Solver,
- Advances in WASP
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- A few logs suffice to build (almost) all trees (I)
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Constructing Camin-Sokal Phylogenies Via Answer Set Programming
- ASP at Work: An ASP Implementation of PhyloWS
This page was built for publication: Optimizing phylogenetic supertrees using answer set programming
