{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:49:09Z","timestamp":1648565349812},"reference-count":0,"publisher":"International Information and Engineering Technology Association","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Revue d'intelligence artificielle"],"published-print":{"date-parts":[[2002,12,1]]},"DOI":"10.3166\/ria.16.657-683","type":"journal-article","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T08:39:18Z","timestamp":1219221558000},"page":"657-683","source":"Crossref","is-referenced-by-count":1,"title":["ASGARD : un algorithme g\u00e9n\u00e9tique pour les r\u00e8gles d'association. Application \u00e0 la g\u00e9nomique"],"prefix":"10.18280","volume":"16","author":[{"given":"Laetitia","family":"Jourdan","sequence":"first","affiliation":[]},{"given":"Clarisse","family":"Dhaenens","sequence":"additional","affiliation":[]},{"given":"El","family":"Ghazali Talbi","sequence":"additional","affiliation":[]}],"member":"7618","container-title":["Revue d'intelligence artificielle"],"original-title":[],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T19:34:30Z","timestamp":1563305670000},"score":1,"resource":{"primary":{"URL":"http:\/\/ria.revuesonline.com\/article.jsp?articleId=4138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,1]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,12,1]]}},"URL":"https:\/\/doi.org\/10.3166\/ria.16.657-683","relation":{},"ISSN":["0992-499X"],"issn-type":[{"value":"0992-499X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12,1]]}}}