Publication no #2050   Type :   Html | Bib | Both
Created: 2010-09-13 18:35:32     Modified: 2014-08-19 19:44:37
2050
photophotophoto
Chris Whidden, Robert G. Beiko and Norbert Zeh. Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. In Proceedings of the ninth International Symposium on Experimental Algorithms (SEA'10), Vol. 6049:141-153 of LNCS, springer, 2010.
Keywords: agreement forest, explicit network, FPT, from rooted trees, hybridization, minimum number, phylogenetic network, phylogeny, Program HybridInterleave, reconstruction, SPR distance.
Note: https://www.cs.dal.ca/sites/default/files/technical_reports/CS-2010-03.pdf.
       
Toggle abstract

@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}
}