Exploring the limits of graph invariant- and spectrum-based discrimination of (sub)structures.
Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet
Standard
in: Journal of Chemical Information and Computer Sciences, Jahrgang 42, Nr. 3, 05.2002, S. 640-650.
Publikation: Beiträge in Zeitschriften › Zeitschriftenaufsätze › Forschung › begutachtet
Harvard
APA
Vancouver
Bibtex
}
RIS
TY - JOUR
T1 - Exploring the limits of graph invariant- and spectrum-based discrimination of (sub)structures.
AU - Rücker, Christoph
AU - Rücker, Gerta
AU - Meringer, Markus
PY - 2002/5
Y1 - 2002/5
N2 - The limits of a recently proposed computer method for finding all distinct substructures of a chemical structure are systematically explored within comprehensive graph samples which serve as supersets of the graphs corresponding to saturated hydrocarbons, both acyclic (up to n = 20) and (poly)cyclic (up to n = 10). Several pairs of smallest graphs and compounds are identified that cannot be distinguished using selected combinations of invariants such as combinations of Balaban's index J and graph matrix eigenvalues. As the most important result, it can now be stated that the computer program NIMSG, using J and distance eigenvalues, is safe within the domain of mono- through tetracyclic saturated hydrocarbon substructures up to n = 10 (oligocyclic decanes) and of all acyclic alkane substructures up to n = 19 (nonadecanes), i.e., it will not miss any of these substructures. For the regions surrounding this safe domain, upper limits are found for the numbers of substructures that may be lost in the worst case, and these are low. This taken together means that the computer program can be reasonably employed in chemistry whenever one is interested in finding the saturated hydrocarbon substructures. As to unsaturated and heteroatom containing substructures, there are reasons to conjecture that the method's resolving power for them is similar.
AB - The limits of a recently proposed computer method for finding all distinct substructures of a chemical structure are systematically explored within comprehensive graph samples which serve as supersets of the graphs corresponding to saturated hydrocarbons, both acyclic (up to n = 20) and (poly)cyclic (up to n = 10). Several pairs of smallest graphs and compounds are identified that cannot be distinguished using selected combinations of invariants such as combinations of Balaban's index J and graph matrix eigenvalues. As the most important result, it can now be stated that the computer program NIMSG, using J and distance eigenvalues, is safe within the domain of mono- through tetracyclic saturated hydrocarbon substructures up to n = 10 (oligocyclic decanes) and of all acyclic alkane substructures up to n = 19 (nonadecanes), i.e., it will not miss any of these substructures. For the regions surrounding this safe domain, upper limits are found for the numbers of substructures that may be lost in the worst case, and these are low. This taken together means that the computer program can be reasonably employed in chemistry whenever one is interested in finding the saturated hydrocarbon substructures. As to unsaturated and heteroatom containing substructures, there are reasons to conjecture that the method's resolving power for them is similar.
KW - Mathematics
KW - Chemistry
UR - http://www.scopus.com/inward/record.url?scp=0036589085&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/f6a5b68c-2be1-3e67-b88d-1edf28165738/
U2 - 10.1021/ci010121y
DO - 10.1021/ci010121y
M3 - Journal articles
VL - 42
SP - 640
EP - 650
JO - Journal of Chemical Information and Computer Sciences
JF - Journal of Chemical Information and Computer Sciences
SN - 0095-2338
IS - 3
ER -