𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ultrafast shape recognition for similarity search in molecular databases

✍ Scribed by Ballester, Pedro J.; Richards, W. Graham

Book ID
120147974
Publisher
The Royal Society
Year
2007
Tongue
English
Weight
522 KB
Volume
463
Category
Article
ISSN
0962-8444

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Ultrafast shape recognition to search co
Ultrafast shape recognition to search compound databases for similar molecular shapes
✍ Pedro J. Ballester; W. Graham Richards πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 475 KB

## Abstract Finding a set of molecules, which closely resemble a given lead molecule, from a database containing potentially billions of chemical structures is an important but daunting problem. Similar molecular shapes are particularly important, given that in biology small organic molecules frequ

SketchSort: Fast All Pairs Similarity Se
SketchSort: Fast All Pairs Similarity Search for Large Databases of Molecular Fingerprints
✍ Yasuo Tabei; Koji Tsuda πŸ“‚ Article πŸ“… 2011 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 865 KB

## Abstract Similarity networks of ligands are often reported useful in predicting chemical activities and target proteins. However, the naive method of computing all pairwise similarities of chemical fingerprints takes quadratic time, which is prohibitive for large scale databases with millions of

Dimensionality Reduction for Similarity
Dimensionality Reduction for Similarity Searching in Dynamic Databases
✍ K.V. Ravi Kanth; Divyakant Agrawal; Amr El Abbadi; Ambuj Singh πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 195 KB

Databases are increasingly being used to store multimedia objects such as maps, images, audio, and video. Storage and retrieval of these objects is accomplished using multidimensional index structures such as R \* -trees and SS-trees. As dimensionality increases, query performance in these index str