The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree

Jesper Jansson, Richard S. Lemence, Andrzej Lingas. The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. SIAM Journal on Computing, 41(1):272-291, 2012. [doi]

@article{JanssonLL12,
  title = {The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree},
  author = {Jesper Jansson and Richard S. Lemence and Andrzej Lingas},
  year = {2012},
  doi = {10.1137/100811489},
  url = {http://dx.doi.org/10.1137/100811489},
  researchr = {https://researchr.org/publication/JanssonLL12},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {41},
  number = {1},
  pages = {272-291},
}