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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.