A novel knowledge representation framework for computing sub-graph isomorphic queries in interaction network databases

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2009, Pages 131-138

  Jamil, Hasan ^a  

^a Wayne State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL NETWORKS; EFFICIENT COMPUTATION; EMERGING APPLICATIONS; GRAPH ISOMORPHISM; GRAPH SEARCH; INTERACTION NETWORKS; LARGE NETWORKS; LOGIC PROGRAMMING LANGUAGES; MEMORY REQUIREMENTS; QUERY REWRITING TECHNIQUES; REPRESENTATION TECHNIQUES; SOCIAL NETWORKS; SUBGRAPHS; UNDIRECTED GRAPH;

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING; OBJECT ORIENTED PROGRAMMING; PROLOG (PROGRAMMING LANGUAGE); QUERY LANGUAGES; SET THEORY;

KNOWLEDGE REPRESENTATION;

EID: 77949534731     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2009.123     Document Type: Conference Paper

References (16)

1. Graph Benchmark Database. http://amalfi.dis.unina.it/graph/.
2. L. Chen and S. Bhowmick. In the search of nectars from evolutionary trees. In DASFAA, pages 714-729, 2009.
3. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In 3rd IAPRTC15 Workshop on Graph-based Representations in Pattern Recognition, pages 149-159, Cuen, 2001.
4. J. E. Hopcroft and J. K.Wong. Linear time algorithm for isomorphism of planar graphs. In ACM Symposium on Theory of Computing, pages 172-184, 1974.
5. Y. Jia, J. Hoberock, M. Garland, and J. C. Hart. On the visualization of social and other scale-free networks. IEEE Trans. Vis. Comput. Graph., 14(6):1285-1292, 2008.
6. M. Koyuturk, Y. Kim, S. Subramanium, W. Szpankowski, and A. Grama. Detecting conserved interaction patterns in biological networks. JCB, 3(7):12991322, 2006.
7. E. M. Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. In IEEE FOCS, pages 42-49, 1980.
8. B. D. McKay. Practical graph isomorphism. Congressus Numerantium, 30:45-87, 1981.
9. E. Rich and K. Knight, editors. Artificial Intelligence. Mc-Graw Hill Higher Education; 2nd edition, 1991.
10. S. Saito, S. Aburatani, and K. Horimoto. Network evaluation from the consistency of the graph structure with the measured data. BMC Systems Biology, 2(84), October 2008.
11. J. Scott, T. Ideker, R. M. Karp, and R. Sharan. Efficient algorithms for detecting signaling pathways in protein interaction networks. J Comput Biol, 13(2):133-144, March 2006.
12. N. Shrivastava, A. Majumder, and R. Rastogi. Mining (social) network graphs to detect random link attacks. In ICDE, pages 486-495, 2008.
13. J. R. Ullmann. An algorithm for subgraph isomorphism. Journal of ACM, 23(1):31-42, 1976.
14. G. Valiente. Algorithms on Trees and Graphs. Springer-Verlag, Berlin, 2002.
15. H. Wang, J. Li, J. Luo, and H. Gao. Hash-based subgraph query processing method for graph-structured xml documents. PVLDB, 1(1):478-489, 2008.
16. H. Wang, J. Li, W. Wang, and X. Lin. Coding-based join algorithms for structural queries on graph-structured xml document. World Wide Web, 11(4):485-510, 2008.