• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

量化树木的自嵌套程度:在植物结构分析中的应用。

Quantifying the degree of self-nestedness of trees: application to the structural analysis of plants.

机构信息

INRIA Project-Team Virtual Plants, UMR, DAP, Montpellier, France.

出版信息

IEEE/ACM Trans Comput Biol Bioinform. 2010 Oct-Dec;7(4):688-703. doi: 10.1109/TCBB.2009.29.

DOI:10.1109/TCBB.2009.29
PMID:21030736
Abstract

In this paper, we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a given height are isomorphic. We show that these trees present remarkable compression properties, with high compression rates. In order to measure how far a tree is from being a self-nested tree, we then study how to quantify the degree of self-nestedness of any tree. For this, we define a measure of the self-nestedness of a tree by constructing a self-nested tree that minimizes the distance of the original tree to the set of self-nested trees that embed the initial tree. We show that this measure can be computed in polynomial time and depict the corresponding algorithm. The distance to this nearest embedding self-nested tree (NEST) is then used to define compression coefficients that reflect the compressibility of a tree. To illustrate this approach, we then apply these notions to the analysis of plant branching structures. Based on a database of simulated theoretical plants in which different levels of noise have been introduced, we evaluate the method and show that the NESTs of such branching structures restore partly or completely the original, noiseless, branching structures. The whole approach is then applied to the analysis of a real plant (a rice panicle) whose topological structure was completely measured. We show that the NEST of this plant may be interpreted in biological terms and may be used to reveal important aspects of the plant growth.

摘要

在本文中,我们对通过具有特定自嵌套结构的树来逼近树的问题感兴趣。自嵌套树是指其所有给定高度的子树都是同构的。我们表明,这些树具有显著的压缩性质,具有很高的压缩率。为了衡量一棵树与自嵌套树的距离,我们研究如何量化任何树的自嵌套程度。为此,我们通过构建一个自嵌套树来定义树的自嵌套度的度量,该树使原始树与嵌入初始树的自嵌套树集合的距离最小。我们表明,该度量可以在多项式时间内计算,并描绘了相应的算法。然后,将到最近嵌入自嵌套树(NEST)的距离用于定义反映树可压缩性的压缩系数。为了说明这种方法,我们将这些概念应用于植物分支结构的分析。基于一个模拟理论植物的数据库,其中引入了不同水平的噪声,我们评估了该方法,并表明这种分支结构的 NEST 部分或完全恢复了原始的、无噪声的分支结构。然后,我们将整个方法应用于对一个真实植物(水稻穗)的分析,该植物的拓扑结构已被完全测量。我们表明,该植物的 NEST 可以用生物学术语来解释,并且可以用于揭示植物生长的重要方面。

相似文献

1
Quantifying the degree of self-nestedness of trees: application to the structural analysis of plants.量化树木的自嵌套程度:在植物结构分析中的应用。
IEEE/ACM Trans Comput Biol Bioinform. 2010 Oct-Dec;7(4):688-703. doi: 10.1109/TCBB.2009.29.
2
Algorithmic height compression of unordered trees.无序树的算法高度压缩
J Theor Biol. 2016 Jan 21;389:237-52. doi: 10.1016/j.jtbi.2015.10.030. Epub 2015 Nov 6.
3
On the quality of tree-based protein classification.论基于树的蛋白质分类的质量。
Bioinformatics. 2005 May 1;21(9):1876-90. doi: 10.1093/bioinformatics/bti244. Epub 2005 Jan 12.
4
Constructing rooted supertrees using distances.使用距离构建有根超级树。
Bull Math Biol. 2004 Nov;66(6):1755-83. doi: 10.1016/j.bulm.2004.04.006.
5
Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle.基于最小进化原理的快速准确的系统发育重建算法。
J Comput Biol. 2002;9(5):687-705. doi: 10.1089/106652702761034136.
6
Gene family evolution by duplication, speciation, and loss.通过基因复制、物种形成和基因丢失实现的基因家族进化。
J Comput Biol. 2008 Oct;15(8):1043-62. doi: 10.1089/cmb.2008.0054.
7
Trees of trees: an approach to comparing multiple alternative phylogenies.树之树:一种比较多个备选系统发育树的方法。
Syst Biol. 2008 Oct;57(5):785-94. doi: 10.1080/10635150802424072.
8
Weighted centroid trees: a general approach to summarize phylogenies in single-labeled tumor mutation tree inference.加权质心树:一种在单标签肿瘤突变树推断中概括系统发育的通用方法。
Bioinformatics. 2024 Jul 1;40(7). doi: 10.1093/bioinformatics/btae120.
9
Robustness of topological supertree methods for reconciling dense incompatible data.用于协调密集不兼容数据的拓扑超树方法的稳健性
IEEE/ACM Trans Comput Biol Bioinform. 2009 Jan-Mar;6(1):62-75. doi: 10.1109/TCBB.2008.51.
10
A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.一种计算有根子树剪接和重新嫁接距离上下界的多项式时间算法。
J Comput Biol. 2011 May;18(5):743-57. doi: 10.1089/cmb.2010.0045. Epub 2010 Dec 18.

引用本文的文献

1
A Statistical Growth Property of Plant Root Architectures.植物根系结构的一种统计生长特性。
Plant Phenomics. 2020 Nov 8;2020:2073723. doi: 10.34133/2020/2073723. eCollection 2020.
2
A Statistical Description of Plant Shoot Architecture.植物芽结构的统计学描述。
Curr Biol. 2017 Jul 24;27(14):2078-2088.e3. doi: 10.1016/j.cub.2017.06.009. Epub 2017 Jul 6.
3
Morphological Plant Modeling: Unleashing Geometric and Topological Potential within the Plant Sciences.植物形态建模:释放植物科学中的几何与拓扑潜能。
Front Plant Sci. 2017 Jun 9;8:900. doi: 10.3389/fpls.2017.00900. eCollection 2017.