Topological Summaries: Using Graphs for Chemical Searching and Mining Graphs are a flexible &...
-
Upload
alberta-walton -
Category
Documents
-
view
219 -
download
1
Transcript of Topological Summaries: Using Graphs for Chemical Searching and Mining Graphs are a flexible &...
![Page 1: Topological Summaries: Using Graphs for Chemical Searching and Mining Graphs are a flexible & unifying model Scalable similarity searches through novel.](https://reader030.fdocuments.net/reader030/viewer/2022032804/56649e4f5503460f94b47358/html5/thumbnails/1.jpg)
Topological Summaries: Using Graphs for Chemical Searching and Mining
• Graphs are a flexible & unifying model• Scalable similarity searches through
novel index structure• Mining of significant fragments in
collections• Classification of compounds based on
significant fragments • Development of SAR models through
geometric mining
Kekule structure Graph Graph with abstract nodes
Protein-ligand interaction
![Page 2: Topological Summaries: Using Graphs for Chemical Searching and Mining Graphs are a flexible & unifying model Scalable similarity searches through novel.](https://reader030.fdocuments.net/reader030/viewer/2022032804/56649e4f5503460f94b47358/html5/thumbnails/2.jpg)
Feature/Benefit Summary
Feature Benefits Novel technologySimilarity Searching(SimFinder tool)
Improved hit identification at lower cost
Better comparison to known drugs
Topology-based searching
Scalable index structure
Active substructure identification(SigFinder tool)
Identification of active substructures for lead identification and optimization
Mining of protein-ligand complexes
Significance model based on graph analysis
Pharmacophore analysis & development(PharmaMiner tool)
Better pharmacophore analysis & models
Fragment based lead discovery
Selective queries on multiple targets
Joint 3D pharmacophore space
![Page 3: Topological Summaries: Using Graphs for Chemical Searching and Mining Graphs are a flexible & unifying model Scalable similarity searches through novel.](https://reader030.fdocuments.net/reader030/viewer/2022032804/56649e4f5503460f94b47358/html5/thumbnails/3.jpg)
SimFinder (Similarity Searching)
• Accuracy and scalability validated through retrospective studies
• Ongoing assays on beta-secretase (Alzheimer’s)
• Comparison of hits with alternative methods such as fingerprints
Database of compounds
Database of graphs
Graph index structure
Abstract nodes & distance matrix
Substructure & similarity queries
transformed to
indexed using
user-provided parameters
accurate & unique results
![Page 4: Topological Summaries: Using Graphs for Chemical Searching and Mining Graphs are a flexible & unifying model Scalable similarity searches through novel.](https://reader030.fdocuments.net/reader030/viewer/2022032804/56649e4f5503460f94b47358/html5/thumbnails/4.jpg)
SigFinder (Mining Significant Substructures)
Compound library
Database offeature vectors
Significant substructures
Prediction of biological activity
Background statistical model Training data
• Statistics-based modeling of substructure significance
• Validation by identification of substructures specific to biological activity
transformed to
Pictorial view of substructure mining
![Page 5: Topological Summaries: Using Graphs for Chemical Searching and Mining Graphs are a flexible & unifying model Scalable similarity searches through novel.](https://reader030.fdocuments.net/reader030/viewer/2022032804/56649e4f5503460f94b47358/html5/thumbnails/5.jpg)
PharmaMiner (Joint 3D Analysis of Pharmacophore Space)
• We define a Joint Pharmacophore Space by extracting 3D descriptors from diverse libraries/targets
• Analysis of pharmacophores in the Joint Space– Classification and clustering for understanding biological
activity – Screening for compounds based on presence and/or
absence of activity• Fragment-based discovery and scaffold hopping • Flexible definition of pharmacophoric features
(donor, acceptor, hydrophobic core, etc.)
5
![Page 6: Topological Summaries: Using Graphs for Chemical Searching and Mining Graphs are a flexible & unifying model Scalable similarity searches through novel.](https://reader030.fdocuments.net/reader030/viewer/2022032804/56649e4f5503460f94b47358/html5/thumbnails/6.jpg)
References
• Huahai He; Ambuj K. Singh; Closure-tree: An Index Structure for Graph Queries. Proceedings of the 22nd International Conference on Data Engineering (ICDE), April, 2006, pp 38 - 50 DOI :10.1109/ICDE.2006.37.
• Huahai He; Ambuj K. Singh; GraphRank: Statistical Modeling and Mining of Significant Subgraphs in the Feature Space. Proceedings of the 6th IEEE International Conference on Data Mining (ICDM), December, 2006, doi:10.1109/ICDM.2006.79
• Sayan Ranu and Ambuj Singh, GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases in 25th International Conference on Data Engineering (ICDE), 2009.
• Sayan Ranu; Ambuj Singh; Mining Statistically Significant Molecular Substructures for Efficient Molecular Classification., J. Chem. Inf. Model., 2009, 49(11), pp 2537–2550 DOI : 10.1021/ci900035z
• Huahai He; Ambuj K. Singh; Graphs-at-a-time: Query Language and Access Methods for Graph Databases, SIGMOD, June, 2008, pp 405-418. ISBN: 978-1-60558-102-6