Pages that link to "Item:Q4601872"
From MaRDI portal
The following pages link to The Complexity of Phylogeny Constraint Satisfaction (Q4601872):
Displaying 15 items.
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- Phylogenetic flexibility via Hall-type inequalities and submodularity (Q1736949) (← links)
- Unique perfect phylogeny is intractable (Q1945932) (← links)
- On the hardness of inferring phylogenies from triplet-dissimilarities (Q2465625) (← links)
- Inferring phylogenetic trees using answer set programming (Q2467563) (← links)
- The Complexity of Rooted Phylogeny Problems (Q3224696) (← links)
- A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
- (Q4643959) (← links)
- (Q5109509) (← links)
- Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
- The Worst Case Complexity of Maximum Parsimony (Q5165594) (← links)
- The Complexity of Phylogeny Constraint Satisfaction Problems (Q5369246) (← links)
- Constructing Camin-Sokal Phylogenies Via Answer Set Programming (Q5387911) (← links)
- Smooth approximations and CSPs over finitely bounded homogeneous structures (Q6649468) (← links)