{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:46:33Z","timestamp":1725734793493},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/icdmw.2011.10","type":"proceedings-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T11:38:12Z","timestamp":1328009892000},"page":"1091-1097","source":"Crossref","is-referenced-by-count":4,"title":["A Constraint Programming Approach for Enumerating Motifs in a Sequence"],"prefix":"10.1109","author":[{"given":"Emmanuel","family":"Coquery","sequence":"first","affiliation":[]},{"given":"Sa\u00efd","family":"Jabbour","sequence":"additional","affiliation":[]},{"given":"Lakhdar","family":"Sa\u00efs","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"654","article-title":"On the power of clause-learning sat solvers with restarts","author":"pipatsrisawat","year":"2009","journal-title":"CP 2009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2005.5"},{"key":"ref12","first-page":"204","article-title":"Constraint programming for itemset mining","author":"deraedt","year":"2008","journal-title":"ACM SIGKDD"},{"key":"ref13","first-page":"1173","article-title":"Backdoors to typical case complexity","author":"williams","year":"2003","journal-title":"IJCAI’ 2003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2001.968634"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"journal-title":"Handbook of Satisfiability Volume 185 of Frontiers in AI and Applications","year":"2009","author":"armin","key":"ref3"},{"key":"ref6","first-page":"58","article-title":"Filtering techniques for rapid user classification","author":"lane","year":"0","journal-title":"AAAI-98\/ICML-98 Joint Workshop on AI Approaches to Time-series Analysis"},{"journal-title":"Constraint Processing","year":"2003","author":"dechter","key":"ref5"},{"key":"ref8","first-page":"297","article-title":"Pattern discovery on character sets and real-valued data: Linear bound on irredundant motifs and an efficient polynomial time algorithm","author":"parida","year":"0","journal-title":"ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref7","first-page":"220","article-title":"GRASP - A New Search Algorithm for Satisfiability","author":"joao","year":"0","journal-title":"Proc IEEE\/ACM CAD"},{"key":"ref2","first-page":"181","article-title":"New encodings of pseudo-boolean constraints into cnf","author":"bailleux","year":"2009","journal-title":"SAT 2009"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-9029-1"},{"key":"ref9","first-page":"131","article-title":"An output-sensitive flexible pattern discovery algorithm","author":"parida","year":"2001","journal-title":"CPM’"}],"event":{"name":"2011 IEEE International Conference on Data Mining Workshops (ICDMW)","start":{"date-parts":[[2011,12,11]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2011,12,11]]}},"container-title":["2011 IEEE 11th International Conference on Data Mining Workshops"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6136510\/6137352\/06137502.pdf?arnumber=6137502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T15:45:12Z","timestamp":1490111112000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6137502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icdmw.2011.10","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}