Who is Who in Phylogenetic Networks

Publication no #2212   Type :   Html | Bib | Both

Created: 2012-04-17 16:36:02     Modified: 2014-08-19 19:45:00

2212 Chris Whidden, Robert G. Beiko and Norbert Zeh. Fixed-Parameter Algorithms for Maximum Agreement Forests. In SICOMP, Vol. 42(4):1431-1466, 2013. Keywords: agreement forest, explicit network, FPT, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, Program HybridInterleave, reconstruction, SPR distance. Note: http://arxiv.org/abs/1108.2664, slides.         Toggle abstract "We present new and improved fixed-parameter algorithms for computing maximum agreement forests of pairs of rooted binary phylogenetic trees. The size of such a forest for two trees corresponds to their subtree prune-and-regraft distance and, if the agreement forest is acyclic, to their hybridization number. These distance measures are essential tools for understanding reticulate evolution. Our algorithm for computing maximum acyclic agreement forests is the first depth-bounded search algorithm for this problem. Our algorithms substantially outperform the best previous algorithms for these problems. © 2013 Society for Industrial and Applied Mathematics." @Article{WBZ2013,       AUTHOR = {Whidden, Chris and Beiko, Robert G. and Zeh, Norbert},       TITLE = {Fixed-Parameter Algorithms for Maximum Agreement Forests},       YEAR = {2013},       JOURNAL = {SICOMP},       VOLUME = {42},       NUMBER = {4},       PAGES = {1431-1466},       URL = {http://dx.doi.org/10.1137/110845045},       NOTE = {http://arxiv.org/abs/1108.2664, slides},       KEYWORDS = {agreement forest, explicit network, FPT, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, Program HybridInterleave, reconstruction, SPR distance} }