{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T14:10:31Z","timestamp":1730211031800,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/csb.2003.1227324","type":"proceedings-article","created":{"date-parts":[[2004,3,23]],"date-time":"2004-03-23T16:02:41Z","timestamp":1080057761000},"page":"244-250","source":"Crossref","is-referenced-by-count":2,"title":["Experimental studies of the universal chemical key (UCK) algorithm on the NCI database of chemical compounds"],"prefix":"10.1109","author":[{"given":"R.","family":"Grossman","sequence":"first","affiliation":[]},{"given":"D.","family":"Hamelberg","sequence":"additional","affiliation":[]},{"given":"P.","family":"Kasturi","sequence":"additional","affiliation":[]},{"given":"B.","family":"Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"198","article-title":"Symmetries in graph coding problem","author":"beyer","year":"1976","journal-title":"Proc NW76 ACM\/CIPC Pac Symp"},{"key":"ref11","first-page":"57","article-title":"A quasi-decision algorithm for the p-equivalence of two matrices","volume":"3","author":"bohm","year":"1964","journal-title":"ICC Bull"},{"key":"ref12","article-title":"Algebraic combinatorics in mathematical chemistry. Methods and algorithms. I. Permutation Graphs and coherent (Cellular) algebras","author":"klin","year":"1995","journal-title":"Technical Report"},{"key":"ref13","first-page":"223","article-title":"Computing automorphism and canonical labeling of graphs","author":"mckay","year":"1977","journal-title":"International Conference on Combinatorial Mathematics"},{"key":"ref14","first-page":"45","article-title":"Practical Graph Isomorphism","volume":"30","author":"mckay","year":"1981","journal-title":"Congressus Numerantium"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50017-9"},{"key":"ref3","first-page":"133","article-title":"Nonisomorphic cycles of maximum length in a series of chemical graphs and the problem of application of IUPAC nomenclature rules","author":"h klin","year":"1992","journal-title":"MATCH 27"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1063\/1.1680839"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1021\/ci00046a014"},{"volume":"23","journal-title":"Chemistry International","year":"2001","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01932948"},{"journal-title":"Nomenclature of Organic Chemistry","year":"1979","key":"ref2"},{"journal-title":"The MD5 message digest algorithm","year":"1992","author":"riverst","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(74)90114-1"}],"event":{"name":"2003 IEEE Bioinformatics Conference. CSB2003","acronym":"CSB-03","location":"Stanford, CA, USA"},"container-title":["Computational Systems Bioinformatics. CSB2003. Proceedings of the 2003 IEEE Bioinformatics Conference. CSB2003"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8699\/27543\/01227324.pdf?arnumber=1227324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T20:29:29Z","timestamp":1489436969000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1227324\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/csb.2003.1227324","relation":{},"subject":[]}}