Author:
Kelk Steven,Fischer Mareike
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics
Reference15 articles.
1. Alimonti P., Kann V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1-2), 123–134 (2000)
2. Bordewich M., Semple C.: On the computational complexity of the rooted subtree prune and regraft distance. Ann. Combin. 8(4), 409–423 (2005)
3. Diestel R.: Graph Theory. Springer-Verlag, Berlin (2005)
4. Archie, J., Day, W., Felsenstein, J., Maddison, W., Meacham, C., Rohlf, F., Swofford, D.: The newick tree format. (2000)
http://evolution.genetics.washington.edu/phylip/newicktree.html
5. Fischer M., Kelk S.: On the maximum parsimony distance between phylogenetic trees. Ann. Combin. 20(1), 87–113 (2016)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献