Cited in
(9)- On unrooted and root-uncertain variants of several well-known phylogenetic network problems
- Tree containment with soft polytomies
- Finding a most parsimonious or likely tree in a network with respect to an alignment
- Solving the tree containment problem in linear time for nearly stable phylogenetic networks
- rSPR
- SPRSupertrees
- S-Cluster++
- scientific article; zbMATH DE number 7238964 (Why is no real title available?)
- Treewidth of display graphs: bounds, brambles and applications
This page was built for software: tcp_package
