Jittat Fakcharoenphol,
Tanee Kumpijit and
Attakorn Putwattana. A Faster Algorithm for the Tree Containment Problem for Binary Nearly Stable Phylogenetic Networks. In Proceedings of the The 12th International Joint Conference on Computer Science and Software Engineering (JCSSE'15), Pages 337-342, IEEE, 2015. Keywords: dynamic programming, explicit network, from network, from rooted trees, nearly-stable network, phylogenetic network, phylogeny, polynomial, tree containment.
@InProceedings{FKP2015,
AUTHOR = {Fakcharoenphol, Jittat and Kumpijit, Tanee and Putwattana, Attakorn},
TITLE = {A Faster Algorithm for the Tree Containment Problem for Binary Nearly Stable Phylogenetic Networks},
YEAR = {2015},
BOOKTITLE = {Proceedings of the The 12th International Joint Conference on Computer Science and Software Engineering (JCSSE'15)},
PAGES = {337-342},
PUBLISHER = {IEEE},
URL = {http://dx.doi.org/10.1109/JCSSE.2015.7219820},
KEYWORDS = {dynamic programming, explicit network, from network, from rooted trees, nearly-stable network, phylogenetic network, phylogeny, polynomial, tree containment} }
|