Highly Influential

@article{Gunawan2017SolvingTC, title={Solving Tree Containment Problem for Reticulation-visible Networks with Optimal Running Time}, author={Andreas Gunawan}, journal={CoRR}, year={2017}, volume={abs/1702.04088} }

- Published 2017 in ArXiv

Tree containment problem is a fundamental problem in phylogenetic study, as it is used to verify a network model. It asks whether a given network contain a subtree that resembles a binary tree. The problem is NP-complete in general, even in the class of binary network. Recently, it was proven to be solvable in cubic time, and later in quadratic time for the… CONTINUE READING

### Presentations referencing similar topics