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. 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]

Authors

Jesper Jansson

This author has not been identified. Look up 'Jesper Jansson' in Google

Richard S. Lemence

This author has not been identified. Look up 'Richard S. Lemence' in Google

Andrzej Lingas

This author has not been identified. Look up 'Andrzej Lingas' in Google