COMPUTER-STORAGE AND RETRIEVAL OF GENERIC CHEMICAL STRUCTURES IN PATENTS .16. THE REFINED SEARCH - AN ALGORITHM FOR MATCHING COMPONENTS OF GENERIC CHEMICAL STRUCTURES AT THE ATOM-BOND LEVEL
Jd. Holliday et Mf. Lynch, COMPUTER-STORAGE AND RETRIEVAL OF GENERIC CHEMICAL STRUCTURES IN PATENTS .16. THE REFINED SEARCH - AN ALGORITHM FOR MATCHING COMPONENTS OF GENERIC CHEMICAL STRUCTURES AT THE ATOM-BOND LEVEL, Journal of chemical information and computer sciences, 35(1), 1995, pp. 1-7
Citations number
23
Categorie Soggetti
Information Science & Library Science","Computer Application, Chemistry & Engineering","Computer Science Interdisciplinary Applications",Chemistry,"Computer Science Information Systems
A description is given of an atom-level search strategy for matching c
omponents of generic chemical structures, called the refined search. T
he components used are those represented by nodes of a reduced graph.
These nodes describe aggregates of atoms of the original chemical grap
h which are similar in structure or chemistry. The reduced graph scree
ning-search results in a List of pairs of matched nodes, one query str
ucture node and one file structure node in each pair, which is the bas
is for the refined search. The atoms and bonds of a query structure no
de are compared with those of a file structure node. Due to the nature
of generics, parts of the structure are expressed either in terms of
real atoms and bonds or in terms of homologous series identifiers, suc
h as alkyl. The fundamental problem concerning an atom-level search is
the translation between the two types of representation for these dif
ferent expressions. An adaptation of the Ullmann algorithm for substru
cture isomorphism has been devised to solve this problem; this is desc
ribed together with several example matches.