g-tries: an efficient data structure for discovering network motifs
In this paper we propose a novel specialized data structure that we call g-trie, designed to deal with collections of subgraphs. The main conceptual idea is akin to a prefix tree in the sense that we take advantage of common topology by constructing a multiway tree where the descendants of a node sh...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | book |
| Idioma: | eng |
| Publicado em: |
2010
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/101828 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/101828 |