Orienting undirected phylogenetic networks

DOI10.1016/j.jcss.2023.103480arXiv1906.07430MaRDI QIDQ6142597

No author found.

Publication date: 4 January 2024

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.07430

zbMATH Keywords

graph algorithmcharacterizationpolynomial-time algorithmcomputational biologyfixed-parameter tractabilitygraph orientationphylogenetic networkphylogenetics

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Phylogenetic networks with every embedded phylogenetic tree a base tree
• Degree-constrained graph orientation: maximum satisfaction and minimum violation
• Colorings and orientations of graphs
• Tree-based unrooted phylogenetic networks
• On unrooted and root-uncertain variants of several well-known phylogenetic network problems
• Exploring the tiers of rooted phylogenetic network space using tail moves
• Reconstructing tree-child networks from reticulate-edge-deleted subnetworks
• On cherry-picking and network containment
• A class of phylogenetic networks reconstructable from ancestral profiles
• Uprooted phylogenetic networks
• Research in Computational Molecular Biology

This page was built for publication: Orienting undirected phylogenetic networks