Department of Mathematics and Statistics, University of Ottawa, Ontario,KIN 6N5, Canada,LaCIM, UQAM, Montreal Quebec, H3C 3P8, Canada;
Department of Biology, University of Ottawa, Ontario, KIN 6N5, Canada;
Sandia National Laboratories, Albuquerque, New Mexico;
Department of Mathematics and Statistics, University of Ottawa, Ontario,KIN 6N5, Canada;
机译:一种更快的算法,用于计算最大协议子树的内核
机译:最大协议子树的内核
机译:最大协议子树和最大兼容树问题的逼近度
机译:解决许多有界度树上的最大一致子树和最大兼容树问题
机译:改进k棵树上最大一致性森林(MAF)的近似比率,并估计k棵树上无环MAF的近似比率。
机译:一种改进的约束上最大协议子树问题
机译:最大协议子树的内核