Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees

Julien Baste, Christophe Paul, Ignasi Sau, Céline Scornavacca. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees. In Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri, editors, Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings. Volume 9778 of Lecture Notes in Computer Science, pages 53-64, Springer, 2016. [doi]

@inproceedings{BastePSS16,
  title = {Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees},
  author = {Julien Baste and Christophe Paul and Ignasi Sau and Céline Scornavacca},
  year = {2016},
  doi = {10.1007/978-3-319-41168-2_5},
  url = {http://dx.doi.org/10.1007/978-3-319-41168-2_5},
  researchr = {https://researchr.org/publication/BastePSS16},
  cites = {0},
  citedby = {0},
  pages = {53-64},
  booktitle = {Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
  editor = {Riccardo Dondi and Guillaume Fertin and Giancarlo Mauri},
  volume = {9778},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-41167-5},
}