Maximum savings in the Steiner problem in phylogeny
暂无分享,去创建一个
[1] M. Hanan,et al. On Steiner’s Problem with Rectilinear Distance , 1966 .
[2] H. Pollak,et al. Steiner Minimal Trees , 1968 .
[3] E. Cockayne. ON THE EFFICIENCY OF THE ALGORITHM FOR STEINER MINIMAL TREES , 1970 .
[4] Frank Harary,et al. Graph Theory , 2016 .
[5] G. Moore,et al. A method for constructing maximum parsimony ancestral amino acid sequences on a given network. , 1973, Journal of theoretical biology.
[6] W. Fitch,et al. Construction of phylogenetic trees. , 1967, Science.
[7] Z. A. Melzak. On the Problem of Steiner , 1961, Canadian Mathematical Bulletin.
[8] Peter B. Gibbons,et al. An algorithm for the steiner problem in graphs , 1982, Networks.
[9] D. Robinson,et al. Comparison of phylogenetic trees , 1981 .
[10] M. O. Dayhoff,et al. Atlas of protein sequence and structure , 1965 .
[11] F. Hwang. On Steiner Minimal Trees with Rectilinear Distance , 1976 .
[12] Jeffrey W. Roberts,et al. 遺伝子の分子生物学 = Molecular biology of the gene , 1970 .
[13] L. Foulds,et al. Testing the theory of evolution by comparing phylogenetic trees constructed from five different protein sequences , 1982, Nature.