{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T07:09:53Z","timestamp":1791270593033,"version":"4.1.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3886,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00183-4","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T14:53:32Z","timestamp":1042815212000},"page":"481-495","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis"],"prefix":"10.1016","volume":"292","author":[{"given":"Tatsuya","family":"Akutsu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Satoru","family":"Miyano","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Satoru","family":"Kuhara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00183-4_BIB1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proc. ACM SIGMOD Conf. on Management of Data, ACM, New York, 1993, pp. 207\u2013216.","DOI":"10.1145\/170035.170072"},{"key":"10.1016\/S0304-3975(02)00183-4_BIB2","series-title":"Proc. COCOON \u201996","first-page":"290","article-title":"Approximating minimum keys and optimal substructure screens","volume":"Vol. 1090","author":"Akutsu","year":"1996"},{"key":"10.1016\/S0304-3975(02)00183-4_BIB3","unstructured":"T. Akutsu, S. Miyano, Selecting informative genes for cancer classification using gene expression data, in: Proc. 2001 IEEE\u2014EURASIP Workshop on Nonlinear Signal and Image Processing (CD-ROM book, http:\/\/www.ee.udel.edu\/nsip\/index.html, 2001)."},{"key":"10.1016\/S0304-3975(02)00183-4_BIB4","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1089\/106652700750050817","article-title":"Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function","volume":"7","author":"Akutsu","year":"2000","journal-title":"J. Comput. Biol."},{"key":"10.1016\/S0304-3975(02)00183-4_BIB5","unstructured":"T. Akutsu, A. Takasu, Inferring approximate functional dependencies from example data, in: Proc. AAAI93 Workshop on Knowledge Discovery in Databases, AAAI, New York, 1993, pp. 138\u2013152."},{"key":"10.1016\/S0304-3975(02)00183-4_BIB6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progression","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbol. Comput."},{"key":"10.1016\/S0304-3975(02)00183-4_BIB7","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(02)00183-4_BIB8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00183-4_BIB9","doi-asserted-by":"crossref","unstructured":"J. Kivinen, H. Mannila, Approximate dependency inference from relations, in: Proc. Fourth Internat. Conf. on Database Theory, 1992, pp. 86\u201398.","DOI":"10.1007\/3-540-56039-4_34"},{"key":"10.1016\/S0304-3975(02)00183-4_BIB10","unstructured":"H. Mannila, K. R\u00e4ih\u00e4, Dependency inference, in: Proc. 13th VLDB Conf., 1987, pp. 155\u2013158."},{"key":"10.1016\/S0304-3975(02)00183-4_BIB11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(92)90031-5","article-title":"On the complexity of inferring functional dependencies","volume":"40","author":"Mannila","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(02)00183-4_BIB12","series-title":"Randomized Algorithms","author":"Motowani","year":"1995"},{"key":"10.1016\/S0304-3975(02)00183-4_BIB13","series-title":"C4.5 Programs for Machine Learning","author":"Quinlan","year":"1993"},{"key":"10.1016\/S0304-3975(02)00183-4_BIB14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/cplx.6130010612","article-title":"Modeling the complexity of genetic networks: understanding multigene and pleiotropic regulation","volume":"1","author":"Somogyi","year":"1996","journal-title":"Complexity"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001834?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001834?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:19Z","timestamp":1759625539000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502001834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502001834"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00183-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(02)00183-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}