Cargando…
An optimal algorithm for computing all subtree repeats in trees
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...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
The Royal Society Publishing
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3996578/ https://www.ncbi.nlm.nih.gov/pubmed/24751873 http://dx.doi.org/10.1098/rsta.2013.0140 |