US4642762A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Storage and retrieval of generic chemical structure representations
Assignee: AMERICAN CHEMICAL SOCIETY
•
Filing: 1984-05-25
•
Granted: 1987-02-10
•
Expires: 2004-05-25
Abstract
Abstract An information retrieval system for storing and searching Markush formulations is described. All implicit specific structures (ISSRs) of the Markush formulation are stored as a specific multiple-connectivity node representation (SpMCN) by allowing the appropriate atoms to expand beyond their normal valance and accommodate all substituents of the Markush structure. The SpMCN is simplified by using a generic group hierarchy to reduce common structural features to an associated generic multi-connectivity node representation (GnMCN) that contains within it implicit generic structures (IGSRs) corresponding to each ISSR. Attributes such as ring size and hetero atom identification are also associated with each generic feature whenever possible. The SpMCN and GnMCN are further simplified by storing their associated structural characteristics as bit strings. To search the stored Markush formulations, a query structure is reduced to its generic structure, attributes, and associated structural characteristic bits strings. The bits strings are compared with the bit strings of the stored structures to eliminate stored structures without the requisite structural features. The generic structure and attributes of the query and remaining stored structures are then compared on a group by group basis and additional structures are thereby eliminated from the search. Finally the specific structure of the query is compared with the specific structures of the remaining stored structures to determine more precisely if there is a match. Reference data, such as patent numbers, are then retrieved for the matched structures.
Inventors
- 👤 William Fisanick
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 02:47
CPC Classifications
G; G16; G16C; G16C20/00; G16C20/90; G16C20/40; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99941; Y10S707/99944; Y10S707/99945
Claims Analysis
Total Claims: 33
Claim 1
Independent Claim
165 words
A method for storing and searching Markush formulations using a programmable digital computer system and comprising: a. forming in said digital computer system a file from a plurality of Markush formulations wherein each said Markush formulation is stored; (1) as a specific multiple connectivity node (SpMCN) representation of all implicit individual specific structural represenations (ISSRs) of each said Markush formulation, (2) as an associated generic multiple connectivity node (GnMCN) representation of all implicit individual generic structural representations (IGSRs) of each said Markush formulation, and (3) with associated reference data, b. comparing in said digital computer system each IGSR of a GnMCN representation of a query Markush formulation with each said IGSR of said file GnMCNs to give a set of file GnMCN answers in which at least one said IGSR of each said file GnMCN answer matches with at least one said IGSR of said query GnMCN, and c. retrieving in said digital computer system said reference data associated with each said file GnMCN answer.
Claim 2
Independent Claim
165 words
A method for storing and searching Markush formulations using a programmable digital computer system and comprising: a. forming in said digital computer system a file from a plurality of Markush formulations wherein each said Markush formulation is stored; (1) as a specific multiple connectivity node (SpMCN) representation of all implicit individual specific structural represenations (ISSRs) of each said Markush formulation, (2) as an associated generic multiple connectivity node (GnMCN) representation of all implicit individual generic structural representations (IGSRs) of each said Markush formulation, and (3) with associated reference data, b. comparing in said digital computer system each IGSR of a GnMCN representation of a query Markush formulation with each said IGSR of said file GnMCNs to give a set of file GnMCN answers in which at least one said IGSR of each said file GnMCN answer matches with at least one said IGSR of said query GnMCN, and c. retrieving in said digital computer system said reference data associated with each said file GnMCN answer.
Claim 3
Dependent Claim
18 words
The method as defined in claim 1 in which said query IGSRs and file IGSRs match by overlap.
Claim 4
Dependent Claim
18 words
The method as defined in claim 1 in which said query IGSRs and file IGSRs match by embedment.
Claim 5
Dependent Claim
73 words
The method as defined in claim 1 further comprising comparing each ISSR of a SpMCN associated with said query GnMCN with each ISSR of said SpMCN associated with each said file GnMCN answer to give a set of file SpMCN answers in which at least one ISSR of each said file SpMCN answer matches with at least one said query ISSR and retrieving said reference data associated with each said file SpMCN answer.
Claim 6
Dependent Claim
21 words
The method as defined in claim 4 wherein only said reference data associated with each said file SpMCN answer is retrieved.
Claim 7
Dependent Claim
18 words
The method as defined in claim 4 in which said query ISSRs and file ISSRs match by overlap.
Claim 8
Dependent Claim
18 words
The method as defined in claim 4 in which said query ISSRs and file ISSRs match by embedment.
Claim 9
Dependent Claim
26 words
The method as defined in claim 4 wherein a hierarchical set of generic groups is used to transform said SpMCN representations to said corresponding GnMCN representations.
Claim 10
Dependent Claim
37 words
The method as defined in claim 8 wherein said hierarchical set of generic groups is used to represent generic features of said query and file Markush formulations in said query and file SpMCN and associated GnMCN representations.
Claim 11
Dependent Claim
133 words
The method as defined in claim 9 wherein said hierarchical set of generic groups comprises any group (G) representative of a chemical entity and wherein said group (G) is further classified as a cyclic group (Cy) and as an acyclic group (Ay) and wherein said cyclic group (Cy) is further classified as a carbocyclic group (Cb) and as a heterocyclic group (Hc); wherein said acyclic group (Ay) is further classified as a carbon group (Ch) and as a noncarbon group (Fg) and wherein said noncarbon group (Fg) is further classified as a terminal group (Ft) and as a connecting group (Fc); and wherein said carbon group (Ch) is further classified as a group (Cg) attached to at least one said terminal group by a multiple bond and as any remaining carbon group (Ak).
Claim 12
Dependent Claim
90 words
The method as defined in claim 10 wherein said terminal group (Ft) comprises a single atom other than carbon or hydrogen and any hydrogen atoms attached to said single atom, and said terminal group (Ft) is connected to one or fewer other groups in said hierarchical set of groups; and said connecting group (Fc) comprises a single atom other than carbon or hydrogen and any hydrogen atoms attached to said single atom, and said connecting group (Fc) is connected to two or more groups in said hierarchical set of groups.
Claim 13
Dependent Claim
35 words
The method as defined in claim 10 wherein said remaining carbon group (Ak) is further classified as a group comprising six or fewer carbon atoms and as a group comprising more than six carbon atoms.
Claim 14
Dependent Claim
36 words
The method as defined in claim 10 wherein said remaining carbon group (Ak) is further classified as a group comprising at least one multiple carbon-carbon bond and as a group comprising any other remaining carbon structure.
Claim 15
Dependent Claim
25 words
The method as defined in claim 9 wherein structurely complex SpMCN and GnMCN representations are simplified by shifting a node of variability to another node.
Claim 16
Dependent Claim
21 words
The method as defined in claim 8 wherein structurely complex SpMCN and GnMCN representations are simplified by using a null node.
Claim 17
Dependent Claim
26 words
The method as defined in claim 9 wherein basic IGSRs and ISSRs are preserved in said GnMCN and SpMCN representations by means of a variable hydrogen.
Claim 18
Dependent Claim
31 words
The method as defined in claim 9 wherein each said generic group of each file GnMCN representation is expanded to include all generic groups above and below it in said hierarchy.
Claim 19
Dependent Claim
50 words
The method as defined in claim 9 wherein each said group of said hierarchical set of groups used to represent said generic features of said query and said file Markush formulations and to transform said query and file SpMCN representations to GnMCN representations is associated with a set of attributes.
Claim 20
Dependent Claim
62 words
The method as defined in claim 18 wherein said set of attributes comprises an identification of noncarbon atoms in said generic group, an identification of an atom count in said generic group, an indication of bond type and number of bonds of said type in said generic group, and an indication of points of attachment of other groups to said generic group.
Claim 21
Dependent Claim
83 words
The method as defined in claim 18 wherein said attributes of each query and file group are compared immediately following said matching of each query and file group in said query and file IGSR comparison step to give a set of file GnMCN answers in which all said attributes of all said groups of at least one said IGSR of said query GnMCN are included in all attributes of all corresponding groups of at least one said IGSR of each said file GnMCN.
Claim 22
Dependent Claim
79 words
The method as defined in claim 18 wherein said attributes of each said group of each said matching query and file IGSRs are compared after said query and file IGSR comparison step to give a set of file GnMCN answers in which all said attributes of all said groups of at least one said IGSR of said query GnMCN are included in all attributes of all corresponding groups of at least one said IGSR of each said file GnMCN.
Claim 23
Dependent Claim
68 words
The method as defined in claim 4 wherein limiting logic in said query and file Markush formulations is stored with said query and file SpMCN representations and is validated after ISSR matching to eliminate any said file SpMCN answer for which said limiting logic no longer allows at least one said ISSR of said query SpMCN to match with at least one ISSR of said file SpMCN answer.
Claim 24
Dependent Claim
65 words
The method as defined in claim 9 wherein said query and file ISSRs and IGSRS are tracked by using an indexing system in which a level of variability is assigned to each atom or generic group in said SpMCN and to corresponding generic groups in said associated GnMCN and a variable-group identifier is assigned to each substituent node in said SpMCN and associated GnMCN representations.
Claim 25
Dependent Claim
23 words
The method as defined in claim 23 wherein said indexing system is used to store complex SpMCNs and GnMCNs as linked partial representations.
Claim 26
Dependent Claim
52 words
The method as defined in claim 17 wherein real-atom segments of a query or file ISSR are rolled-back to a corresponding generic group of said associated IGSR during ISSR matching to allow for generic-group matching when either a corresponding query or file ISSR segment is a generic feature of said Markush formulation.
Claim 27
Dependent Claim
112 words
The method as defined in claim 1 further comprising: a. storing each said file GnMCN representation as an associated generic-group bit string comprising all generic-group screens of all IGSRs of each said file GnMCN representation, b. comparing a generic-group logic expression comprising all generic-group screens of each IGSR of a query GnMCN with said file generic-group bit strings to give a set of file generic-group bit string answers in which said generic-group logic expression of at least one IGSR of said query GnMCN is included within each file generic-group bit-string answer, and c. using said GnMCN representations associated with said file specific-atom bit-string answers in said query and file IGSR comparison step.
Claim 28
Dependent Claim
198 words
The method as defined in claim 4 further comprising: a. storing each said file GnMCN representation as an associated generic-group bit string comprising all generic-group screens of all IGSRs of each said file GnMCN representation and as an associated specific-atom bit string comprising all real-atom screens of all ISSRs of each said associated file SpMCN representation, b. comparing a generic-group logic expression comprising all generic-group screens of each IGSR of a query GnMCN with said file generic-group bit strings to give a set of file generic-group bit string answers in which said generic-group logic expression of at least one IGSR of said query GnMCN is included within each file generic-group bit-string answer, and c. comparing a specific-atom logic expression comprising all specific-atom screens of each ISSR of an SpMCN associated with said query GnMCN with said specific-atom bit strings associated with said generic-group bit-string answers to give a set of file specific-atom bit-string answers in which said specific-atom expression of at least one ISSR of said query SpMCN is included within each said file specific-atom bit-string answer and d. using said GnMCN representations associated with said file specific-atom bit-string answers in said query and file IGSR comparison step.
Claim 29
Dependent Claim
182 words
The method as defined in claim 17 further comprising: a. storing each said file Markush formulation as a single generic-group, specific-atom, and diagnostic-group bit string comprising all generic-group and diagnostic group screens of all IGSRs of each file GnMCN representation and all specific-atom screens of all ISSRs of said associated SpMCN representation, b. forming a query logic expression for each ISSR and corresponding IGSR of a query SpMCN and associated GnMCN comprising sets of generic-group screens and sets of specific-atom screens with corresponding alternative diagnostic-group or diagnostic-group combination screens in which each set of specific-atoms screens is limited to atoms included within boundaries defined by said corresponding diagnostic group or diagnostic-group combination, c. comparing said query logic expression with said file bit strings to give a set of file bit string answers in which said query logic expression of at least one ISSR and associated IGSR of said query SpMCN and associated GnMCN is included within each file bit string answer, and d. using said GnMCN representations associated with said file bit string answers in said query and file IGSR comparison step.
Claim 30
Dependent Claim
167 words
The method as defined in claim 17 further comprising: a. storing a Markush formulation identifier with a screen file index term for each generic-group, diagnostic-group, and specific-atom screen included in all ISSRs and IGSRs of a file SpMCN and associated GnMCN representation, b. forming a query logic expression for each ISSR and corresponding IGSR of a query SpMCN and associated GnMCN comprising sets of generic-group screens and sets of specific-atom screens with corresponding alternative diagnostic-group or diagnostic-group combination screens in which each set of specific-atoms screens is limited to atoms included within boundaries defined by said corresponding diagnostic group or diagnostic-group combination, c. comparing said query logic expressions with said identifiers associated with said screen file index terms to give a set of said identifiers in which all required screens of said query logic expression are included within said screen file index terms for a particular identifier, and d. using said GnMCN representations associated with said Markush formulation identifier in said query and file IGSR comparison step.
Claim 31
Independent Claim
535 words
A method for storing and searching Markush formulations using a programmable digital computer system and comprising: a. forming in said digital computer system a file from a plurality of Markush formulations wherein each said Markush formulation is stored: (1) as a specific multiple connectivity node (SpMCN) representation of all implicit individual specific structural representations (ISSRs) of each said Markush formulation that includes a hierarchial generic-group representation of all generic features of said Markush formulation, (2) as an associated generic multiple connectivity node (GnMCN) representation of all implicit individual generic structural representations (IGSRs) obtained by a hierarchial generic-group transformation of said SpMCN representation, (3) as a set of attributes associated with each generic group of said GnMCN representation, (4) as a generic-group, specific-atom, and diagnostic-group bit string comprising all generic-group and diagnostic-group screens of all IGSRs of each GnMCN representation and all specific-atom screens of all ISSRs of said associated SpMCN representation, (5) with associated limiting logic from said Markush Formulation, and (6) with associated reference data, b. forming in said digital computer system a query logic expression for each ISSR and corresponding IGSR of a query SpMCN and associated GnMCN comprising sets of generic-group screens and sets of specific-atom screens with corresponding alternative diagnostic-group or diagnostic-group combination screens in which each set of specific-atoms screens is limited to atoms included within boundaries defined by said corresponding diagnostic group or diagnostic-group combination, c. comparing in said digital computer system said query logic expression with file bit strings to give a set of file bit string answers in which said query logic expression of at least one ISSR and associated IGSR of said query SpMCN and associated GnMCN is included within each file bit string answer, d. comparing in said digital computer system each IGSR of said query GnMCN representation with each said IGSR of said file GnMCNs associated with each file bit string answer to give a set of file GnMCN answers in which at least one said IGSR of each said file GnMCN answer matches with at least one said IGSR of said query GnMCN, e. comparing in said digital computer system said attributes of each said group of each said matching query and file IGSR to give a set of file GnMCN answers in which all said attributes of all said groups of at least one said IGSR of said query GnMCN are included in all attributes of all corresponding groups of at least one said IGSR of each said file GnMCN, f. comparing in said digital computer system each ISSR of a SpMCN associated with said query GnMCN with each ISSR of each SpMCN associated with each said file GnMCN answer to give a set of file SpMCN answers in which at least one ISSR of each said file SpMCN answer matches with at least one said query ISSR, g. validating in said digital computer system said limiting logic to eliminate any said file SpMCN answer for which said limiting logic no longer allows at least one said ISSR of said query SpMCN to match with at least one ISSR of said file SpMCN answer, and h. retrieving in said digital computer system said reference data associated with each said file SpMCN answer.
Claim 32
Independent Claim
535 words
A method for storing and searching Markush formulations using a programmable digital computer system and comprising: a. forming in said digital computer system a file from a plurality of Markush formulations wherein each said Markush formulation is stored: (1) as a specific multiple connectivity node (SpMCN) representation of all implicit individual specific structural representations (ISSRs) of each said Markush formulation that includes a hierarchial generic-group representation of all generic features of said Markush formulation, (2) as an associated generic multiple connectivity node (GnMCN) representation of all implicit individual generic structural representations (IGSRs) obtained by a hierarchial generic-group transformation of said SpMCN representation, (3) as a set of attributes associated with each generic group of said GnMCN representation, (4) as a generic-group, specific-atom, and diagnostic-group bit string comprising all generic-group and diagnostic-group screens of all IGSRs of each GnMCN representation and all specific-atom screens of all ISSRs of said associated SpMCN representation, (5) with associated limiting logic from said Markush Formulation, and (6) with associated reference data, b. forming in said digital computer system a query logic expression for each ISSR and corresponding IGSR of a query SpMCN and associated GnMCN comprising sets of generic-group screens and sets of specific-atom screens with corresponding alternative diagnostic-group or diagnostic-group combination screens in which each set of specific-atoms screens is limited to atoms included within boundaries defined by said corresponding diagnostic group or diagnostic-group combination, c. comparing in said digital computer system said query logic expression with file bit strings to give a set of file bit string answers in which said query logic expression of at least one ISSR and associated IGSR of said query SpMCN and associated GnMCN is included within each file bit string answer, d. comparing in said digital computer system each IGSR of said query GnMCN representation with each said IGSR of said file GnMCNs associated with each file bit string answer to give a set of file GnMCN answers in which at least one said IGSR of each said file GnMCN answer matches with at least one said IGSR of said query GnMCN, e. comparing in said digital computer system said attributes of each said group of each said matching query and file IGSR to give a set of file GnMCN answers in which all said attributes of all said groups of at least one said IGSR of said query GnMCN are included in all attributes of all corresponding groups of at least one said IGSR of each said file GnMCN, f. comparing in said digital computer system each ISSR of a SpMCN associated with said query GnMCN with each ISSR of each SpMCN associated with each said file GnMCN answer to give a set of file SpMCN answers in which at least one ISSR of each said file SpMCN answer matches with at least one said query ISSR, g. validating in said digital computer system said limiting logic to eliminate any said file SpMCN answer for which said limiting logic no longer allows at least one said ISSR of said query SpMCN to match with at least one ISSR of said file SpMCN answer, and h. retrieving in said digital computer system said reference data associated with each said file SpMCN answer.
Claim 33
Dependent Claim
70 words
The method as defined in claim 30 further comprising means for graphic structure input, means for establishing and maintaining a telecommunications interface, means for query and search control, means for database management, means for screen search, means for group-by-group, attribute, and atom-by-atom comparison, means for logic condition verification, means for answer retrieval and online answer output, means for off-line answer printing, and means for said system support, maintenance, and backup.
References Cited (Backward Citations)
US4473890A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-02-09 | 1990-08-11 | 1991-02-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-02-09 | 1994-08-11 | 1995-02-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-02-09 | 1998-08-11 | 1999-02-10 | $7700.00 | Window Closed / Lapsed |