• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利：CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法，用中文像聊天一样搜索，搜遍4000万医学文献。AI智能推荐，让科研检索更轻松。

立即免费搜索

文件翻译

保留排版，准确专业，支持PDF/Word/PPT等文件格式，支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述，25分钟生成高质量综述，智能提取关键信息，辅助科研写作。

立即免费体验

Minimally colored trees.

作者信息

Rinsma I, Hendy M, Penny D

机构信息

Department of Mathematics and Statistics, Waikato University, Hamilton, New Zealand.

出版信息

Math Biosci. 1990 Mar;98(2):201-10. doi: 10.1016/0025-5564(90)90124-h.

DOI:10.1016/0025-5564(90)90124-h
PMID:2134502
Abstract

Each edge in a weighted colored tree has a nonnegative weight corresponding to the colors of its incident vertices. The sum of these weights is the weight of the tree. Algorithms of O(n) are known to find minimal colorings, that is, to assign colors from a given finite set to the vertices of a tree so as to minimize the weight of the tree. In this paper generating functions are used to find the number of minimal colorings and the average weight of each edge over such colorings, also using O(n) operations. Applications to evolutionary trees are given.

摘要

相似文献

1
Minimally colored trees.
Math Biosci. 1990 Mar;98(2):201-10. doi: 10.1016/0025-5564(90)90124-h.
2
Path costs in evolutionary tree reconstruction.进化树重建中的路径成本。
J Comput Biol. 1997 Summer;4(2):163-75. doi: 10.1089/cmb.1997.4.163.
3
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.资源削减：一种用于枚举树状化学图算法的新上界过程。
IEEE/ACM Trans Comput Biol Bioinform. 2019 Jan-Feb;16(1):77-90. doi: 10.1109/TCBB.2018.2832061. Epub 2018 May 1.
4
Hunting for trees in binary character sets: efficient algorithms for extraction, enumeration, and optimization.
J Comput Biol. 1996 Summer;3(2):275-88. doi: 10.1089/cmb.1996.3.275.
5
Neighborhoods of trees in circular orderings.循环排序中树的邻域。
Bull Math Biol. 2015 Jan;77(1):46-70. doi: 10.1007/s11538-014-0049-1. Epub 2014 Dec 5.
6
Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.用于无根系统发育树（严格）兼容性的高效固定参数可解算法
Bull Math Biol. 2017 Apr;79(4):920-938. doi: 10.1007/s11538-017-0260-y. Epub 2017 Feb 28.
7
Encoding phylogenetic trees in terms of weighted quartets.根据加权四重奏对系统发育树进行编码。
J Math Biol. 2008 Apr;56(4):465-77. doi: 10.1007/s00285-007-0125-3. Epub 2007 Sep 21.
8
Comparison of additive trees using circular orders.使用循环顺序对加法树进行比较。
J Comput Biol. 2000;7(5):731-44. doi: 10.1089/106652701446170.
9
Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems.最大一致子树和最大兼容树问题的参数化复杂度改进
IEEE/ACM Trans Comput Biol Bioinform. 2006 Jul-Sep;3(3):289-302. doi: 10.1109/TCBB.2006.39.
10
On uniform edge-n-colorings of tilings.关于平铺的均匀边\(n\)染色
Acta Crystallogr A Found Adv. 2024 Sep 1;80(Pt 5):367-378. doi: 10.1107/S2053273324005643. Epub 2024 Jul 29.

引用本文的文献

1
The geometric mean length, a new statistic to describe the distribution of character steps on a tree.几何平均长度，一种描述树上性状步长分布的新统计量。
Cladistics. 2004 Jun;20(3):219-222. doi: 10.1111/j.1096-0031.2004.00017.x.
2
Tracing the HIV-1 subtype B mobility in Europe: a phylogeographic approach.追踪欧洲HIV-1 B亚型的传播：一种系统地理学方法。
Retrovirology. 2009 May 20;6:49. doi: 10.1186/1742-4690-6-49.