Metraipolis › archive › dc_10de855bb7a3

A logarithm-free subexponential algorithm for minimum quartet inconsistency — arXiv:2611.01569

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01569
License (as archived)
CC0-1.0
Archived
2026-11-03T11:45:39.340Z
SHA-256 of the archived text
d54dc9265da72ff1b4513ed61fc90b4367075410e95acda10644ca17c8b38dfb
Stable URL of this page
https://metraipolis.com/documento/dc_10de855bb7a3

How to cite

A logarithm-free subexponential algorithm for minimum quartet inconsistency — arXiv:2611.01569 — arXiv (en), https://arxiv.org/abs/2611.01569 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_10de855bb7a3 (Metraipolis archive dc_10de855bb7a3, sha256 d54dc9265da72ff1b4513ed61fc90b4367075410e95acda10644ca17c8b38dfb)
BibTeX
@misc{dc10de855bb7a3,
  title = {A logarithm-free subexponential algorithm for minimum quartet inconsistency — arXiv:2611.01569},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01569},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_10de855bb7a3; sha256 d54dc9265da72ff1b4513ed61fc90b4367075410e95acda10644ca17c8b38dfb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01569. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We give a deterministic algorithm for complete, unweighted minimum quartet inconsistency (MQI) with time and space $2^{O(k^{1/4})}+n^{O(1)}$, where $n$ is the number of taxa and~$k$ is the allowed number of quartet disagreements. This removes the logarithmic factor from the exponent of the MQI bound announced in 2009. The algorithm combines low-error anchoring, chromatic coding, and dynamic programming that accounts for disagreements with all input quartets, with a refined count of colorings and merging states. We also record a generic ETH-based lower bound. The optimality of the fourth-root exponent remains open.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.01569 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:07:52.236Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).