Author:
Shutters Brad,Vakati Sudheer,Fernández-Baca David
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Agarwala, R., Fernández-Baca, D.: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM Journal on Computing 23(6), 1216–1224 (1994)
2. Aho, A.V., Sagiv, Y., Szymanski, T.G., Ullman, J.D.: Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing 10(3), 405–421 (1981)
3. Lecture Notes in Computer Science;H. Bodlaender,1992
4. Bryant, D., Steel, M.: Extension operations on sets of leaf-labelled trees. Advances in Applied Mathematics 16, 425–453 (1995)
5. Buneman, P.: The recovery of trees from measurements of dissimilarity. In: Mathematics in the Archeological and Historical Sciences, pp. 387–395. Edinburgh University Press (1971)