Author:
Górecki Paweł,Eulenstein Oliver
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Bansal, M.S., Burleigh, J.G., Eulenstein, O., Fernández-Baca, D.: Robinson-foulds supertrees. Algorithms for Molecular Biology 5, 18 (2010)
2. Lecture Notes in Computer Science;M.A. Bender,2000
3. Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8, 409–423 (2004)
4. Bourque, M.: Abres de Steiner et reseaux dont varie I’emplagement de certains sommnets. PhD thesis, Department d’Informatique, University Montréal, Montréal (1978)
5. Bryant, D., Steel, M.: Computing the distribution of a tree metric. IEEE/ACM Trans. Comput. Biol. Bioinform. 6(3), 420–426 (2009)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献