Copertina

Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Mestel, David, Chaplick, Steven, Kelk, Steven, Meuwese, Ruben
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms Populations and Evolution
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Snakes and Ladders: a Treewidth Story
di: Chaplick, Steven, et al.
Pubblicazione: (2023)

A branch-&-price approach to the unrooted maximum agreement forest problem
di: Frohn, Martin, et al.
Pubblicazione: (2024)

A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
di: Kelk, Steven, et al.
Pubblicazione: (2026)

Reconstructing semi-directed level-1 networks using few quarnets
di: Frohn, Martin, et al.
Pubblicazione: (2024)

LvD: A New Algorithm for Computing the Likelihood of a Phylogeny
di: Bryant, David, et al.
Pubblicazione: (2026)

phylo2vec: a library for vector-based phylogenetic tree manipulation
di: Scheidwasser, Neil, et al.
Pubblicazione: (2025)

Analysis of Phylogeny Tracking Algorithms for Serial and Multiprocess Applications
di: Moreno, Matthew Andres, et al.
Pubblicazione: (2024)

Graph-based method for constructing consensus trees
di: Torquet, Elio, et al.
Pubblicazione: (2025)

Meeting times on graphs in near-cubic time
di: McAvoy, Alex
Pubblicazione: (2026)

Bayesian Credible Sets for Phylogenetic Tree Topologies with Applications to Coverage Analysis and Cross-Model Comparison
di: Klawitter, Jonathan, et al.
Pubblicazione: (2025)

Computational support for case-heavy proofs in mathematical phylogenetics
di: Forte, Luca, et al.
Pubblicazione: (2025)

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
di: Draesslerová, Dominika, et al.
Pubblicazione: (2024)

When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
di: Huber, Katharina T., et al.
Pubblicazione: (2024)

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
di: van Iersel, Leo, et al.
Pubblicazione: (2026)

Galled Perfect Transfer Networks
di: Sánchez, Alitzel López, et al.
Pubblicazione: (2024)

When is local search both effective and efficient?
di: Kaznatcheev, Artem, et al.
Pubblicazione: (2024)

Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four
di: Kaznatcheev, Artem, et al.
Pubblicazione: (2024)

On the existence of funneled orientations for classes of rooted phylogenetic networks
di: Döcker, Janosch, et al.
Pubblicazione: (2024)

Phylogenetic Inference under the Balanced Minimum Evolution Criterion via Semidefinite Programming
di: Skums, P.
Pubblicazione: (2026)

Bounding the SNPR distance between two tree-child networks using generalised agreement forests
di: Kelk, Steven, et al.
Pubblicazione: (2025)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
di: Chaplick, Steven, et al.
Pubblicazione: (2024)

Local search for valued constraint satisfaction parameterized by treedepth
di: Kaznatcheev, Artem
Pubblicazione: (2024)

Seed Selection in the Heterogeneous Moran Process
di: Petsinis, Petros, et al.
Pubblicazione: (2024)

A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
di: Frohn, Martin, et al.
Pubblicazione: (2024)

A strengthened bound on the number of states required to characterize maximum parsimony distance
di: Fischer, Mareike, et al.
Pubblicazione: (2025)

Tree Containment Parameterized by Scanwidth
di: van Iersel, Leo, et al.
Pubblicazione: (2026)

An FPT algorithm for Matching Cut and d-cut
di: Aravind, N R, et al.
Pubblicazione: (2021)

FPT algorithms over linear delta-matroids with applications
di: Eiben, Eduard, et al.
Pubblicazione: (2025)

Coconvex characters on collections of phylogenetic trees
di: Czabarka, Eva, et al.
Pubblicazione: (2025)

Improved FPT Approximation for Non-metric TSP
di: Bampis, Evripidis, et al.
Pubblicazione: (2024)

Product-State Approximation Algorithms for the Transverse Field Ising Model
di: Lipardi, Vincenzo, et al.
Pubblicazione: (2026)

Bounds on the sequence length sufficient to reconstruct binary level-$1$ phylogenetic networks under the CFN model
di: Frohn, Martin, et al.
Pubblicazione: (2025)

An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange
di: Jansen, Bart M. P., et al.
Pubblicazione: (2025)

FPT Approximation for Capacitated Sum of Radii
di: Jaiswal, Ragesh, et al.
Pubblicazione: (2024)

FPT Approximations for Connected Maximum Coverage
di: Inamdar, Tanmay, et al.
Pubblicazione: (2026)

A Vector Representation for Phylogenetic Trees
di: Chauve, Cedric, et al.
Pubblicazione: (2024)

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
di: Cervenjak, Philip, et al.
Pubblicazione: (2024)

FPT approximations for Capacitated Sum of Radii and Diameters
di: Filtser, Arnold, et al.
Pubblicazione: (2024)

Optimal FPT-Approximability for Modular Linear Equations
di: Dabrowski, Konrad K., et al.
Pubblicazione: (2026)

Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost
di: Li, Shuguang, et al.
Pubblicazione: (2025)