CRACS/INESC TEC receives best paper award
An article authored by Pedro Ribeiro and Fernando Silva, both researchers at the Center for Research in Advanced Computing Systems (CRACS), received the Best Paper Award at the DBSocial 2012 - ACM SIGMOD Workshop on Databases and Social Networks, which took place last May.
02nd July 2012
The article, entitled "Querying subgraph sets with G-Tries", explores the use of a data structure originally created as part of the Pedro Ribeiro’s PhD work, the G-Tries, in the search for patterns in complex networks. In particular, this article shows how the 'g-tries' can be used to very efficiently look for a general set of patterns of any size (subgraphs) in any other network (a large graph can contain many occurrences of the desired subgraphs).
The search for pattern has diverse applications, in particular in network comparisons. For example, if we imagine two groups of biological networks in the brain, one describing a healthy brain and the other describing a diseased brain (for instance, from a patient suffering from epilepsy or Alzheimer's), this search can identify patterns that best distinguish and characterise these two types of groups.
The experimental results show that the proposed algorithm has a performance substantially better than all the algorithms currently used for this purpose and this algorithm is one to two orders of magnitude faster than other competitor algorithms.
BIP, June 2012