2 citations · 2 across the 1 of their papers we have counts for
1 paper
Mathias Weller
We consider the NP-hard Tree Containment problem that has important applications in phylogenetics. The problem asks if a given leaf-labeled network contains a subdivision of a give…