Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mestel, David, Chaplick, Steven, Kelk, Steven, Meuwese, Ruben
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Populations and Evolution
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Snakes and Ladders: a Treewidth Story
par: Chaplick, Steven, et autres
Publié: (2023)

A branch-&-price approach to the unrooted maximum agreement forest problem
par: Frohn, Martin, et autres
Publié: (2024)

A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
par: Kelk, Steven, et autres
Publié: (2026)

Reconstructing semi-directed level-1 networks using few quarnets
par: Frohn, Martin, et autres
Publié: (2024)

LvD: A New Algorithm for Computing the Likelihood of a Phylogeny
par: Bryant, David, et autres
Publié: (2026)

phylo2vec: a library for vector-based phylogenetic tree manipulation
par: Scheidwasser, Neil, et autres
Publié: (2025)

Analysis of Phylogeny Tracking Algorithms for Serial and Multiprocess Applications
par: Moreno, Matthew Andres, et autres
Publié: (2024)

Graph-based method for constructing consensus trees
par: Torquet, Elio, et autres
Publié: (2025)

Meeting times on graphs in near-cubic time
par: McAvoy, Alex
Publié: (2026)

Bayesian Credible Sets for Phylogenetic Tree Topologies with Applications to Coverage Analysis and Cross-Model Comparison
par: Klawitter, Jonathan, et autres
Publié: (2025)

Computational support for case-heavy proofs in mathematical phylogenetics
par: Forte, Luca, et autres
Publié: (2025)

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
par: Draesslerová, Dominika, et autres
Publié: (2024)

When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?
par: Huber, Katharina T., et autres
Publié: (2024)

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
par: van Iersel, Leo, et autres
Publié: (2026)

Galled Perfect Transfer Networks
par: Sánchez, Alitzel López, et autres
Publié: (2024)

When is local search both effective and efficient?
par: Kaznatcheev, Artem, et autres
Publié: (2024)

Exponential Steepest Ascent from Valued Constraint Graphs of Pathwidth Four
par: Kaznatcheev, Artem, et autres
Publié: (2024)

On the existence of funneled orientations for classes of rooted phylogenetic networks
par: Döcker, Janosch, et autres
Publié: (2024)

Phylogenetic Inference under the Balanced Minimum Evolution Criterion via Semidefinite Programming
par: Skums, P.
Publié: (2026)

Bounding the SNPR distance between two tree-child networks using generalised agreement forests
par: Kelk, Steven, et autres
Publié: (2025)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
par: Chaplick, Steven, et autres
Publié: (2024)

Local search for valued constraint satisfaction parameterized by treedepth
par: Kaznatcheev, Artem
Publié: (2024)

Seed Selection in the Heterogeneous Moran Process
par: Petsinis, Petros, et autres
Publié: (2024)

A 2-approximation algorithm for the softwired parsimony problem on binary, tree-child phylogenetic networks
par: Frohn, Martin, et autres
Publié: (2024)

A strengthened bound on the number of states required to characterize maximum parsimony distance
par: Fischer, Mareike, et autres
Publié: (2025)

Tree Containment Parameterized by Scanwidth
par: van Iersel, Leo, et autres
Publié: (2026)

An FPT algorithm for Matching Cut and d-cut
par: Aravind, N R, et autres
Publié: (2021)

FPT algorithms over linear delta-matroids with applications
par: Eiben, Eduard, et autres
Publié: (2025)

Coconvex characters on collections of phylogenetic trees
par: Czabarka, Eva, et autres
Publié: (2025)

Improved FPT Approximation for Non-metric TSP
par: Bampis, Evripidis, et autres
Publié: (2024)

Product-State Approximation Algorithms for the Transverse Field Ising Model
par: Lipardi, Vincenzo, et autres
Publié: (2026)

Bounds on the sequence length sufficient to reconstruct binary level-$1$ phylogenetic networks under the CFN model
par: Frohn, Martin, et autres
Publié: (2025)

An ETH-Tight FPT Algorithm for Rejection-Proof Set Packing with Applications to Kidney Exchange
par: Jansen, Bart M. P., et autres
Publié: (2025)

FPT Approximation for Capacitated Sum of Radii
par: Jaiswal, Ragesh, et autres
Publié: (2024)

FPT Approximations for Connected Maximum Coverage
par: Inamdar, Tanmay, et autres
Publié: (2026)

A Vector Representation for Phylogenetic Trees
par: Chauve, Cedric, et autres
Publié: (2024)

Maximum Unique Coverage on Streams: Improved FPT Approximation Scheme and Tighter Space Lower Bound
par: Cervenjak, Philip, et autres
Publié: (2024)

FPT approximations for Capacitated Sum of Radii and Diameters
par: Filtser, Arnold, et autres
Publié: (2024)

Optimal FPT-Approximability for Modular Linear Equations
par: Dabrowski, Konrad K., et autres
Publié: (2026)

Improved algorithms for single machine serial-batch scheduling to minimize makespan and maximum cost
par: Li, Shuguang, et autres
Publié: (2025)