@InProceedings{WBZ2010,
AUTHOR = {Whidden, Chris and Beiko, Robert G. and Zeh, Norbert},
TITLE = {Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments},
YEAR = {2010},
BOOKTITLE = {Proceedings of the ninth International Symposium on Experimental Algorithms (SEA'10)},
VOLUME = {6049},
PAGES = {141-153},
SERIES = {LNCS},
PUBLISHER = {springer},
URL = {http://dx.doi.org/10.1007/978-3-642-13193-6_13},
NOTE = {https://www.cs.dal.ca/sites/default/files/technical_reports/CS-2010-03.pdf},
KEYWORDS = {agreement forest, explicit network, FPT, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, Program HybridInterleave, reconstruction, SPR distance}
}
|
- forked on GitHub.