Sciweavers

21 search results - page 3 / 5
» Discovering frequent geometric subgraphs
Sort
View
DIS
2007
Springer
13 years 11 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
BIBM
2008
IEEE
145views Bioinformatics» more  BIBM 2008»
14 years 1 months ago
Identifying Interface Elements Implied in Protein-Protein Interactions Using Statistical Tests and Frequent Item Sets
Understanding what are the characteristics of proteinprotein interfaces is at the core of numerous applications. This paper introduces a method in which the proteins are described...
Christine Martin, Antoine Cornuéjols
HPCC
2005
Springer
14 years 29 days ago
High Performance Subgraph Mining in Molecular Compounds
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...
Giuseppe Di Fatta, Michael R. Berthold
BMCBI
2008
141views more  BMCBI 2008»
13 years 7 months ago
Discovering functional interaction patterns in protein-protein interaction networks
Background: In recent years, a considerable amount of research effort has been directed to the analysis of biological networks with the availability of genome-scale networks of ge...
Mehmet E. Turanalp, Tolga Can
TSE
2008
113views more  TSE 2008»
13 years 7 months ago
Discovering Neglected Conditions in Software by Mining Dependence Graphs
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
Ray-Yaung Chang, Andy Podgurski, Jiong Yang