Cover Image

Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Baghirova, Narmina, Galby, Esther, Milanič, Martin
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Data Structures and Algorithms Combinatorics Populations and Evolution 05C85 (Primary), 05C20, 05C90, 06A07, 92D10 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the correctness of Maximum Parsimony for data with few substitutions in the NNI neighborhood of phylogenetic trees
by: Fischer, Mareike
Published: (2024)

Recognizing Level-k-Based Phylogenetic Networks is NP-Complete
by: Suzuki, Takatora
Published: (2026)

Phylogenetic diversity indices from an affine and projective viewpoint
by: Moulton, Vincent, et al.
Published: (2024)

Which Phylogenetic Networks are Level-k Networks with Additional Arcs? Structure and Algorithms
by: Suzuki, Takatora, et al.
Published: (2025)

Vector encoding of phylogenetic trees by ordered leaf attachment
by: Richman, Harry, et al.
Published: (2025)

Exploring subgraph complementation to bounded degree graphs
by: Koch, Ivo, et al.
Published: (2025)

Computational methods for finding bi-regular cages
by: Goedgebeur, Jan, et al.
Published: (2024)

A survey of the monotonicity and non-contradiction of consensus methods and supertree methods
by: Fischer, Mareike, et al.
Published: (2021)

Excluding an induced wheel minor in graphs without large induced stars
by: Choi, Mujin, et al.
Published: (2025)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
by: Chiarelli, Nina, et al.
Published: (2024)

"Normal" phylogenetic networks may be emerging as the leading class
by: Francis, Andrew
Published: (2021)

Tree independence number V. Walls and claws
by: Chudnovsky, Maria, et al.
Published: (2025)

Transformations to simplify phylogenetic networks
by: Heiss, Johanna, et al.
Published: (2024)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
by: Milanič, Martin, et al.
Published: (2024)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)

M-polynomial Based Mathematical Formulation of the Hyperbolic Sombor Index
by: Barman, Jayjit, et al.
Published: (2026)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
by: Bousquet, Nicolas, et al.
Published: (2024)

Arboreal networks and their underlying trees
by: Huber, Katharina T., et al.
Published: (2025)

Conformality of Minimal Transversals of Maximal Cliques
by: Boros, Endre, et al.
Published: (2024)

Branch-width of connectivity functions is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026)

Awesome graph parameters
by: Štorgel, Kenny Bešter, et al.
Published: (2025)

Minimal $L^p$-congestion spanning trees on weighted graphs
by: Lafuente, Alberto Castejón, et al.
Published: (2025)

Characterizations of undirected 2-quasi best match graphs
by: Korchmaros, Annachiara, et al.
Published: (2025)

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
by: Galby, Esther, et al.
Published: (2024)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
by: Chiarelli, Nina, et al.
Published: (2023)

A simple quadratic kernel for Token Jumping on surfaces
by: Cranston, Daniel W., et al.
Published: (2024)

Enumeration of rooted binary perfect phylogenies
by: Shiff, Chloe E., et al.
Published: (2024)

Group centrality in optimal and suboptimal vaccination for epidemic models in contact networks
by: Cerdeira, J. Orestes, et al.
Published: (2025)

Compactifications of phylogenetic systems and species of electrical networks
by: Devadoss, Satyan L., et al.
Published: (2024)

Young domination on Hamming rectangles
by: Gravner, Janko, et al.
Published: (2025)

Layered tree-independence number and clique-based separators
by: Dallard, Clément, et al.
Published: (2025)

A greedy heuristic for graph burning
by: García-Díaz, Jesús, et al.
Published: (2024)

Algorithmic Pot Generation: Algorithms for the Flexible-Tile Model of DNA Self-Assembly
by: Ashworth, Jacob, et al.
Published: (2024)

On the redundancy of transitivity constraints in the clique partitioning problem
by: Sukegawa, Noriyoshi
Published: (2026)

Computing the forcing spectrum of outerplanar graphs in polynomial time
by: Gorsky, Maximilian, et al.
Published: (2024)

On 3-Coloring of $(2P_4,C_5)$-Free Graphs
by: Jelínek, Vít, et al.
Published: (2020)

Small-scale operations on graphic sequences
by: Rusu, Irena
Published: (2026)

Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
by: Chiu, Yung-Chung, et al.
Published: (2021)

Beyond level-1: Identifiability of a class of galled tree-child networks
by: Allman, Elizabeth S., et al.
Published: (2025)

Computation of Minimum Numbers of Tile and Bond-Edge Types for DNA Self-Assembly of Select Archimedean Graphs
by: Merrithew, Tabitha, et al.
Published: (2025)