A carregar...
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...
Na minha lista:
| Main Authors: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
The Royal Society Publishing
2014
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3996578/ https://ncbi.nlm.nih.gov/pubmed/24751873 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1098/rsta.2013.0140 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|