g-tries: an efficient data structure for discovering network motifs

Authors:
Pedro Ribeiro;Fernando Silva
Affiliations:
Universidade do Porto, R. Campo Alegre, Porto, Portugal;Universidade do Porto, R. Campo Alegre, Porto, Portugal
Venue:
Proceedings of the 2010 ACM Symposium on Applied Computing
Year:
2010

Citing 9
Cited 6

Data mining: concepts and techniques

Data mining: concepts and techniques
Trie memory

Communications of the ACM
Frequent Subgraph Discovery

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs

Bioinformatics
Conserved network motifs allow protein--protein interaction prediction

Bioinformatics
Graph mining: Laws, generators, and algorithms

ACM Computing Surveys (CSUR)
FANMOD: a tool for fast network motif detection

Bioinformatics
Efficient Detection of Network Motifs

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)

Efficient subgraph frequency estimation with g-tries

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Parallel discovery of network motifs

Journal of Parallel and Distributed Computing
Querying subgraph sets with g-tries

DBSocial '12 Proceedings of the 2nd ACM SIGMOD Workshop on Databases and Social Networks
Comparison of Co-authorship Networks across Scientific Fields Using Motifs

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Towards a faster network-centric subgraph census

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
G-Tries: a data structure for storing and finding subgraphs

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 share a common substructure. We give algorithms to construct a g-trie, to list all stored subgraphs, and to find occurrences on another graph of the subgraphs stored in the g-trie. We evaluate the implementation of this structure and its associated algorithms on a set of representative benchmark biological networks in order to find network motifs. To assess the efficiency of our algorithms we compare their performance with other known network motif algorithms also implemented in the same common platform. Our results show that indeed, g-tries are a feasible, adequate and very efficient data structure for network motifs discovery, clearly outperforming previous algorithms and data structures.