 Therefore, the concept of " tree-based " phylogenetic networks, which was introduced by Francis and Steel, has attracted much attention of theoretical biologists in the last few years. In this context, spanning trees of a certain kind called "subdivision trees" play an essential role and there are many important computational problems about them, whose time complexity is still unclear. Against this backdrop, the present paperaims to provide a graph theoretical framework for solving different problems on subdivision trees in a simple and unified manner.
<clarity>  Therefore, the concept of " tree-based " phylogenetic networks, which was introduced by Francis and Steel, has attracted much attention of theoretical biologists in the last few years. In this context, spanning trees of a certain kind called "subdivision trees" play an essential role and there are many important computational problems about them, whose time complexity is still unclear. Against this backdrop, the present paperaims to provide a graph theoretical framework for solving different problems on subdivision trees in a simple and unified manner.
 Therefore, the concept of " tree-based " phylogenetic networks, which was introduced by Francis and Steel, has attracted much attention of theoretical biologists . However, the application of such networks is still not easy, due to many problems whose time complexities are not clearly understood. In this paper, we provide a general framework for solving different problems on subdivision trees in a simple and unified manner.