The Deep Coalescence Consensus Tree Problem is Pareto on Clusters

Harris T. Lin, J. Gordon Burleigh, Oliver Eulenstein. The Deep Coalescence Consensus Tree Problem is Pareto on Clusters. In Jianer Chen, Jianxin Wang, Alexander Zelikovsky, editors, Bioinformatics Research and Applications - 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011. Proceedings. Volume 6674 of Lecture Notes in Computer Science, pages 172-183, Springer, 2011. [doi]

@inproceedings{LinBE11,
  title = {The Deep Coalescence Consensus Tree Problem is Pareto on Clusters},
  author = {Harris T. Lin and J. Gordon Burleigh and Oliver Eulenstein},
  year = {2011},
  doi = {10.1007/978-3-642-21260-4_19},
  url = {http://dx.doi.org/10.1007/978-3-642-21260-4_19},
  researchr = {https://researchr.org/publication/LinBE11},
  cites = {0},
  citedby = {0},
  pages = {172-183},
  booktitle = {Bioinformatics Research and Applications - 7th International Symposium, ISBRA 2011, Changsha, China, May 27-29, 2011. Proceedings},
  editor = {Jianer Chen and Jianxin Wang and Alexander Zelikovsky},
  volume = {6674},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-21259-8},
}