.png){kind=icon}
返回
An optimal algorithm for computing all subtree repeats in trees
.png){kind=icon}
OA
AI
DOI：10.1098/rsta.2013.0140.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a labelled tree T, our goal is to group repeating subtrees of T into equivalence classes with respect to their topologies and the node labels. We present an explicit, simple and time-optimal algorithm for solving this problem for unrooted unordered labelled trees and show that the running time of our method is linear with respect to the size of T. By unordered, we mean that the order of the adjacent nodes (children/neighbours) of any node of T is irrelevant. An unrooted tree T does not have a node that is designated as root and can also be referred to as an undirected tree. We show how the presented algorithm can easily be modified to operate on trees that do not satisfy some or any of the aforementioned assumptions on the tree structure; for instance, how it can be applied to rooted, ordered or unlabelled trees.
Keyword:
tree data structures
unrooted unordered labelled trees
subtree repeats
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
P
IF:
3.7
论文数:
7.8K
被引数:
2.8W
机构
引用论文
.png){kind=icon}
分享收藏Insulin-like Growth Factor II Messenger RNA-binding Protein 3 in Salivary Gland Tumors胰岛素样生长因子II信使RNA结合蛋白3在唾液腺肿瘤中OAAI
OAAI分享收藏Effect of clinical application of anti-CD38 and anti-CD47 monoclonal antibodies on blood group detection and transfusion therapy and treatment抗CD38和抗CD47单克隆抗体临床应用对血型检测、输血治疗及治疗效果的影响
PREAI
分享收藏Protein expression levels of excision repair cross-complementation group 1 and xeroderma pigmentosum D correlate with response to platinum-based chemotherapy in the patients with advanced epithelial ovarian cancer切除修复交叉互补组1和xeroderma pigmentosum D的蛋白质表达水平与晚期上皮性卵巢癌患者对铂类化疗的反应相关。
PREAI
分享收藏
查看更多内容