Chemoinformatics 2003
DOI: 10.1002/3527601643.ch6
|View full text |Cite
|
Sign up to set email alerts
|

Searching Chemical Structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2006
2006
2019
2019

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(11 citation statements)
references
References 34 publications
0
11
0
Order By: Relevance
“…[35] Tc is calculated from the number of bits in common divided by the total number of bits in both molecules and ranges between zero (maximum dissimilarity) and one (maximum similarity). In the case of MACCS fingerprints we used a cutoff of 0.85 as the empirical threshold for correlating structural similarity with biological activity.…”
Section: Molecular Descriptors and Similarity Evaluationmentioning
confidence: 99%
“…[35] Tc is calculated from the number of bits in common divided by the total number of bits in both molecules and ranges between zero (maximum dissimilarity) and one (maximum similarity). In the case of MACCS fingerprints we used a cutoff of 0.85 as the empirical threshold for correlating structural similarity with biological activity.…”
Section: Molecular Descriptors and Similarity Evaluationmentioning
confidence: 99%
“…The same holds true for the search for references (i.e., documents which a patent cites) and of citations (i.e., documents in which a patent is cited) for both single patents and patent families. In chemistry (Gasteiger & Engel, 2003;Kochev, Monev, & Bangov, 2003) such as searching for chemical compounds including threedimensional structures (Engel, 2003) and similarity searching (Willett, Barnard, & Downs, 1998), searching for chemical reactions (Gasteiger, 2003), and "prophetic" Markush structures (Berks, 2001;Simmons, 2003). In biochemistry, genetics, and biotechnology, one needs a functionality to search for biosequences both exactly and in a fuzzy mode (Dufresne, Takäcs, Heus, Codani, & Duval, 2002;Xu, Webster, & Doran, 2002;Yoo, Ramanathan, & Barcelon-Yang, 2005).…”
Section: Patent Informationmentioning
confidence: 98%
“…Accordingly, a structure search, which is the most simple database query, is a routine operation. For the essentials see Kochev et al 71 Mining 3D structure databases is a similar problem of substantial importance for pharmacophore mapping and searches for possible ligands using the ligand-based drug discovery paradigm. Hash key is a function used for data structure organization.…”
Section: Structure and Substructure Searchesmentioning
confidence: 99%
“…The translation of the molecular graph to a canonical molecular representation is the basic operation that enables such a query. 72 The reader is also referred to Kochev et al 71 for the list of software available for structure, substructure, and similarity searches. In this context, the translation of the canonical SMILES strings or Augmented Connectivity Molecular Formula in the ACS Registry System into hash codes is an important operation.…”
Section: Structure and Substructure Searchesmentioning
confidence: 99%