Path partitions of phylogenetic networks

DOI10.1016/j.tcs.2024.114907MaRDI QIDQ6652450

Manuel Lafond, Vincent Moulton

Publication date: 12 December 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

phylogenetic networkstree-basedpath partitionsforest-basedmonotone NAE-3-SAT

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90)

Cites Work

• Unnamed Item
• On the complexity of deciding whether the regular number is at most two
• Fixed-parameter algorithms for DAG partitioning
• The directed subgraph homeomorphism problem
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Splitting a graph into disjoint induced paths or cycles.
• Which problems have strongly exponential complexity?
• Tree-based unrooted phylogenetic networks
• Linear time algorithms for two disjoint paths problems on directed acyclic graphs
• Tree-based unrooted nonbinary phylogenetic networks
• A relaxation of the directed disjoint paths problem: a global congestion metric helps
• Overlaid species forests
• \(\alpha\)-diperfect digraphs
• Classes of explicit phylogenetic networks and their biological and mathematical significance
• Orchard networks are trees with additional horizontal arcs
• On cherry-picking and network containment
• A class of phylogenetic networks reconstructable from ancestral profiles
• New characterisations of tree-based networks and proximity measures
• Forest-based networks
• Phylogeny
• Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
• The Induced Disjoint Paths Problem
• The Directed Disjoint Shortest Paths Problem
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Parameterizing path partitions
• Is this network proper forest-based?

Related Items (1)

Parameterizing path partitions

This page was built for publication: Path partitions of phylogenetic networks