Indexing and mining topological patterns for drug discovery

作者: Sayan Ranu , Ambuj K. Singh

DOI: 10.1145/2247596.2247666

关键词: Search engine indexingComputer scienceNetwork topologyMolecular DatabasesInformaticsGraph databaseMolecule miningTheoretical computer scienceData miningHeuristicsDrug discovery

摘要: Increased availability of large repositories chemical compounds has created new challenges and opportunities for the application data-mining indexing techniques to problems in informatics. The primary goal analysis molecular databases is identify structural patterns that can predict biological activity. Two most popular approaches representing topologies are graphs 3D geometries. As a result, problem mining map from graph geometric databases.In this tutorial, we will first introduce drug discovery how computer science plays critical role process. We then proceed by introducing performing subgraph similarity searches on databases. Due NP-hardness problems, number heuristics have been designed recent years tutorial present an overview those techniques. Next, frequent along with some their limitations ignited interest statistically significant patterns. After presenting in-depth survey patterns, towards analyzing structures molecules. Finally, conclude two open impact field discovery.

参考文章(30)
N. Vanetik, E. Gudes, Mining frequent labeled and partially labeled graph patterns international conference on data engineering. pp. 91- 102 ,(2004) , 10.1109/ICDE.2004.1319987
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda, An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data european conference on principles of data mining and knowledge discovery. pp. 13- 23 ,(2000) , 10.1007/3-540-45372-5_2
Sayan Ranu, Ambuj K. Singh, Novel Method for Pharmacophore Analysis by Examining the Joint Pharmacophore Space Journal of Chemical Information and Modeling. ,vol. 51, pp. 1106- 1121 ,(2011) , 10.1021/CI100503Y
James Cheng, Yiping Ke, Wilfred Ng, An Lu, Fg-index Proceedings of the 2007 ACM SIGMOD international conference on Management of data - SIGMOD '07. pp. 857- 872 ,(2007) , 10.1145/1247480.1247574
Yevgeniy Podolyan, George Karypis, Common pharmacophore identification using frequent clique detection algorithm. Journal of Chemical Information and Modeling. ,vol. 49, pp. 13- 21 ,(2009) , 10.1021/CI8002478
Siegfried Nijssen, Joost N. Kok, The Gaston Tool for Frequent Subgraph Mining Electronic Notes in Theoretical Computer Science. ,vol. 127, pp. 77- 87 ,(2005) , 10.1016/J.ENTCS.2004.12.039
Lei Zou, Lei Chen, Jeffrey Xu Yu, Yansheng Lu, A novel spectral coding in a large graph database extending database technology. pp. 181- 192 ,(2008) , 10.1145/1353343.1353369
David W Williams, Jun Huan, Wei Wang, None, Graph Database Indexing Using Structured Graph Decomposition international conference on data engineering. pp. 976- 985 ,(2007) , 10.1109/ICDE.2007.368956
Zhiping Zeng, Anthony K. H. Tung, Jianyong Wang, Jianhua Feng, Lizhu Zhou, Comparing stars: on approximating graph edit distance very large data bases. ,vol. 2, pp. 25- 36 ,(2009) , 10.14778/1687627.1687631
Dennis Shasha, Jason T. L. Wang, Rosalba Giugno, Algorithmics and applications of tree and graph searching symposium on principles of database systems. pp. 39- 52 ,(2002) , 10.1145/543613.543620