Recent progresses in the combinatorial and algorithmic study of rooted phylogenetic networks

DOI10.1007/978-3-030-39881-1_3OpenAlexW3000905430MaRDI QIDQ782149FDOQ782149

Authors: Louxin Zhang 

Publication date: 22 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39881-1_3

Recommendations

• Counting and enumerating tree-child networks and their subclasses
• Counting and enumerating galled networks
• A decomposition theorem and two algorithms for reticulation-visible networks
• Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
• Counting phylogenetic networks with few reticulation vertices: galled and reticulation-visible networks

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited In (3)

• On unrooted and root-uncertain variants of several well-known phylogenetic network problems
• Algorithms and Computation
• Book review of: D. Gusfield, ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks

This page was built for publication: Recent progresses in the combinatorial and algorithmic study of rooted phylogenetic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782149)