AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Finding Most Compatible Phylogenetic Trees over Multi-State Characters

Tuukka Korhonen, Matti J„ärvisalo

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Decision-focused optimization · 3 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use MaxSAT for second phase instead of Bin IP at larger kBT + MaxSAT · 640 ms instances, k in {4,10,20,40}timeouts / solved instancesImproved
use MaxSAT instead of Minsep IP at larger rBT + MaxSAT · 640 ms instances, r in {0,1,2,4}timeouts / solved instancesImproved
compare MaxSAT with Minsep IP, Bin IP and PBO while varying n, k or rBT + MaxSAT · ms instances n=200,k=20,r=2 fixed, 20 instances eachinstances solved out of 20Improved
use MaxSAT approach on real-world benchmarks versus other approachesBT + MaxSAT · Chinese dialects, Indo-European, Mammals, Alcataeniarunning time: < 5 secondsNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy