Jesper Jansson, Richard S. Lemence, Andrzej Lingas. The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree. In Vincent Moulton, Mona Singh, editors, Algorithms in Bioinformatics, 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, 2010. Proceedings. Volume 6293 of Lecture Notes in Computer Science, pages 262-273, Springer, 2010. [doi]
@inproceedings{JanssonLL10,
title = {The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree},
author = {Jesper Jansson and Richard S. Lemence and Andrzej Lingas},
year = {2010},
doi = {10.1007/978-3-642-15294-8_22},
url = {http://dx.doi.org/10.1007/978-3-642-15294-8_22},
researchr = {https://researchr.org/publication/JanssonLL10},
cites = {0},
citedby = {0},
pages = {262-273},
booktitle = {Algorithms in Bioinformatics, 10th International Workshop, WABI 2010, Liverpool, UK, September 6-8, 2010. Proceedings},
editor = {Vincent Moulton and Mona Singh},
volume = {6293},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-15293-1},
}