Solving the tree containment problem for reticulation-visible networks in linear time

DOI10.1007/978-3-319-91938-6_3MaRDI QIDQ1660112zbMATH OpenOpenAlexFDO

Authors Andreas Dwi Maryanto Gunawan

Publication date 15 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-91938-6_3

zbMATH Keywords

tree containment problemphylogeny reconstructionreticulation-visible

Mathematics Subject Classification ID

Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Solving the tree containment problem in linear time for nearly stable phylogenetic networks
• A decomposition theorem and two algorithms for reticulation-visible networks
• Solving the tree containment problem for genetically stable networks in quadratic time
• Locating a tree in a phylogenetic network
• Linear time algorithm for tree-child network containment

Cited in

(9)

• Tree containment with soft polytomies
• Reticulation-visible networks
• Embedding phylogenetic trees in networks of low treewidth
• Display sets of normal and tree-child networks
• A decomposition theorem and two algorithms for reticulation-visible networks
• Solving the tree containment problem in linear time for nearly stable phylogenetic networks
• Locating a tree in a phylogenetic network in quadratic time
• Solving the tree containment problem for genetically stable networks in quadratic time
• Linear time algorithm for tree-child network containment

This page was built for publication: Solving the tree containment problem for reticulation-visible networks in linear time

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