pith. sign in

Do branch lengths help to locate a tree in a phylogenetic network?

Philippe Gambette, Leo Van Iersel, Steven Kelk, Fabio Pardi, Celine Scornavacca · 2016 · DOI 10.1007/s11538-016-0199-4

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

clear filters

representative citing papers

Tree Containment Parameterized by Scanwidth

cs.DS · 2026-05-29 · unverdicted · novelty 6.0

An O(4^{k + k log k} n + n m^2)-time algorithm for TREE CONTAINMENT parameterized by scanwidth k of a given tree-extension, with a matching ETH lower bound of no 2^{o(c log c)} n^{O(1)} algorithm for directed cutwidth c even on binary inputs.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Tree Containment Parameterized by Scanwidth cs.DS · 2026-05-29 · unverdicted · none · ref 11

    An O(4^{k + k log k} n + n m^2)-time algorithm for TREE CONTAINMENT parameterized by scanwidth k of a given tree-extension, with a matching ETH lower bound of no 2^{o(c log c)} n^{O(1)} algorithm for directed cutwidth c even on binary inputs.