Finding maximum common contractions between phylogenetic networks
From MaRDI portal
Cites work
- All that glisters is not galled
- Comparison of phylogenetic trees
- Computing the maximum agreement of phylogenetic networks
- Contractibility and NP-completeness
- Contraction distance between isomorphism classes of graphs
- Contractions of Planar Graphs in Polynomial Time
- Defining phylogenetic networks using ancestral profiles
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved hardness of maximum common subgraph problems on labeled graphs of bounded treewidth and bounded degree
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat}
- On maximum common subgraph problems in series-parallel graphs
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- On the computational complexity of the rooted subtree prune and regraft distance
- Parameterized complexity of three edge contraction problems with degree constraints
- Paths to trees and cacti
- Scanning phylogenetic networks is NP-hard
- The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
- Tripartitions do not always discriminate phylogenetic networks
This page was built for publication: Finding maximum common contractions between phylogenetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857970)
