The Complexity of Rooted Phylogeny Problems

DOI10.2168/LMCS-7(4:6)2011zbMath1237.68095arXiv1110.0693MaRDI QIDQ3224696

Manuel Bodirsky, Jens K. Mueller

Publication date: 2 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.0693

zbMATH Keywords

computational complexityDatalogconstraint satisfaction problemsphylogenetic reconstruction\(\omega\)-categorical structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15)

Related Items

The complexity of surjective homomorphism problems-a survey ⋮ An initial study of time complexity in infinite-domain constraint satisfaction