Triangulating three-colored graphs
暂无分享,去创建一个
[1] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..
[2] Derek G. Corneil,et al. Complexity of finding embeddings in a k -tree , 1987 .
[3] David Sankoff,et al. COMPUTATIONAL COMPLEXITY OF INFERRING PHYLOGENIES BY COMPATIBILITY , 1986 .
[4] D Sankoff,et al. Computational complexity of inferring phylogenies from chromosome inversion data. , 1987, Journal of theoretical biology.
[5] Andrzej Proskurowski,et al. Separating subgraphs in k-trees: Cables and caterpillars , 1984, Discret. Math..
[6] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .
[7] David S. Johnson,et al. The computational complexity of inferring rooted phylogenies by parsimony , 1986 .
[8] R. Graham,et al. The steiner problem in phylogeny is NP-complete , 1982 .
[9] Sampath Kannan,et al. Inferring evolutionary history from DNA sequences , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[10] F. McMorris,et al. When are two qualitative taxonomic characters compatible? , 1977, Journal of mathematical biology.