Name
Abstract | ||
|---|---|---|
We propose an approach to network querying in protein-protein interaction networks based on bipartite graph weighted matching. An algorithm is presented that first "focuses" the potentially relevant portion of the target graph by performing a global alignment of this one with the query graph, and then "zooms" on the actual matching nodes by considering their topological arrangement, hereby obtaining a (possibly) approximated occurrence of the query graph within the target graph. Approximation is related to node insertions, node deletions and edge deletions possibly intervening in the query graph. The technique manages networks of arbitrary topology. Moreover, edge labels are used to represent and manage the reliability of involved interactions. Some preliminary experimental analysis is also accounted for in the paper. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-70600-7_25 | BIOINFORMATICS RESEARCH AND DEVELOPMENT, PROCEEDINGS |
Keywords | Field | DocType |
experimental analysis,bipartite graph | Biconnected graph,Computer science,Theoretical computer science,Artificial intelligence,Voltage graph,Adjacency matrix,Folded cube graph,Simplex graph,Null graph,Bioinformatics,Butterfly graph,Machine learning,Graph (abstract data type) | Conference |
Volume | ISSN | Citations |
13 | 1865-0929 | 6 |
PageRank | References | Authors |
0.41 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Valeria Fionda | 1 | 130 | 18.53 |
| Luigi Palopoli | 2 | 1387 | 185.69 |
| Simona Panni | 3 | 74 | 6.80 |
| Simona E. Rombo | 4 | 192 | 22.21 |