.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
tree data structures
unrooted unordered labelled trees
subtree repeats
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
P
IF:
3.7
Papers:
7.8K
Citations:
2.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more