City University of New York, Bronx.
City University of New York, New York.
IEEE/ACM Trans Comput Biol Bioinform. 2013 Jul-Aug;10(4):1076-9. doi: 10.1109/TCBB.2013.105.
We answer Bryant's combinatorial challenge on minimal walks of phylogenetic treespace under the nearest-neighbor interchange (NNI) metric. We show that the shortest path through the NNI-treespace of n-leaf trees is Hamiltonian for all n. That is, there is a minimal path that visits all binary trees exactly once, under NNI moves.
我们回答了 Bryant 提出的关于在最近邻交换（NNI）度量下的系统发育树空间中的最短路径问题。我们证明了对于所有的 n 叶树，NNI 树空间中的最短路径是哈密顿路径。也就是说，在 NNI 操作下，存在一条经过所有二叉树恰好一次的最短路径。
Zotero 插件