@article{constantinescu1995,
	title = {An Efficient Algorithm for Supertrees},
	author = {Mariana Constantinescu and David Sankoff},
	journal = {Journal of Classification},
	pages = {101-112},
	volume = {12},
	year = {1995},
	biburl = {http://www.bibsonomy.org/bibtex/2cd1d0744b29fc1f0f441e2fc843ca5a8/thau},
	abstract = {Given k rooted binary trees A t,A2,..,Ak, with labeled leaves, we generate
C, a unique system of lineage constraints on common ancestors. We then
present an algorithm for constructing the set of rooted binary trees B, compatible
with all of A I,A2,..,Ak. The running time to obtain one such supertree is},
	date-added = {2008-05-07 12:48:42 -0700}, date-modified = {2008-05-07 12:50:02 -0700},
	keywords = {supertrees }
}