Cover Image

Inferring DAGs and Phylogenetic Networks from Least Common Ancestors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lindeberg, Anna, Alfonsson, Anton, Moulton, Vincent, Scholz, Guillaume E., Hellmuth, Marc
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
by: Lindeberg, Anna, et al.
Published: (2024)

Characterizing and Transforming DAGs within the I-LCA Framework
by: Hellmuth, Marc, et al.
Published: (2024)

Orthology and Near-Cographs in the Context of Phylogenetic Networks
by: Lindeberg, Anna, et al.
Published: (2025)

Network Representation and Modular Decomposition of Combinatorial Structures: A Galled-Tree Perspective
by: Lindeberg, Anna, et al.
Published: (2024)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
by: Hellmuth, Marc, et al.
Published: (2023)

Inferring Phylogenetic Networks from Required and Forbidden LCA-Constraints
by: Ebert, Patricia A., et al.
Published: (2026)

Labeling and folding multi-labeled trees
by: Moulton, Vincent, et al.
Published: (2025)

Global Least Common Ancestor (LCA) Networks
by: Lindeberg, Anna, et al.
Published: (2025)

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
by: Hatzel, Meike, et al.
Published: (2024)

On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
by: Petersen, Johannes B. S., et al.
Published: (2025)

Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, et al.
Published: (2024)

Computing the clique number of tournaments
by: Aubian, Guillaume
Published: (2024)

(Claw, C_3)-free digraphs with unbounded dichromatic number
by: Aubian, Guillaume, et al.
Published: (2026)

Characterizing traces of processes defined by precedence and response constraints: an order theory approach
by: Dukes, Mark, et al.
Published: (2023)

Expected Length of the Longest Common Subsequence of Multiple Strings
by: Li, Ray, et al.
Published: (2025)

Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)

Token positional games
by: Bagan, Guillaume, et al.
Published: (2026)

On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)

A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)

Extension of the Gyárfás-Sumner conjecture to signed graphs
by: Aubian, Guillaume, et al.
Published: (2025)

Constrained Flows in Networks
by: Bessy, Stéphane, et al.
Published: (2023)

Tree-partitions and small-spread tree-decompositions
by: Distel, Marc, et al.
Published: (2026)

On a recolouring version of Hadwiger's conjecture
by: Bonamy, Marthe, et al.
Published: (2021)

Winding number and circular 4-coloring of signed graphs
by: Gujgiczer, Anna, et al.
Published: (2023)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021)

Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)

On graph classes with constant domination-packing ratio
by: Bonamy, Marthe, et al.
Published: (2025)

Treewidth 2 in the Planar Graph Product Structure Theorem
by: Distel, Marc, et al.
Published: (2024)

Planar graphs in blowups of fans
by: Distel, Marc, et al.
Published: (2024)

Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)

Valid Cuts for the Design of Potential-based Flow Networks
by: Börner, Pascal, et al.
Published: (2025)

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
by: Gadouleau, Maximilien, et al.
Published: (2024)

Block Designs and K-Geodetic Graphs: A Survey
by: Frasser, Carlos E.
Published: (2025)

A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
by: Frasser, Carlos E.
Published: (2026)

On a Problem of Ramsey Theory
by: Frasser, Carlos E.
Published: (2024)

Sunflowers in set systems with small VC-dimension
by: Balogh, József, et al.
Published: (2024)

A note on the distinct distances problem over finite fields
by: Brukhim, Nataly, et al.
Published: (2025)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
by: Garzón, E. M., et al.
Published: (2024)