{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T02:53:49Z","timestamp":1729652029392,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/cibcb.2011.5948452","type":"proceedings-article","created":{"date-parts":[[2011,7,13]],"date-time":"2011-07-13T11:48:47Z","timestamp":1310557727000},"page":"1-8","source":"Crossref","is-referenced-by-count":1,"title":["Tackling the challenging motif problem through hybrid particle swarm optimized alignment clustering"],"prefix":"10.1109","author":[{"given":"Chengpeng","family":"Bi","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2010.01.023"},{"key":"17","doi-asserted-by":"crossref","DOI":"10.1186\/1471-2105-10-S1-S13","article-title":"DNA motif alignment through evolving a population of Markov chains","volume":"10","author":"bi","year":"2009","journal-title":"BMC Bioinformatics"},{"key":"18","first-page":"275","article-title":"A genetic-based EM motif-finding algorithm for biological sequence analysis","volume":"200","author":"bi","year":"0","journal-title":"Proc IEEE Symp Comput Intell Bioinf Comput Biol"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.2202\/1544-6115.1260"},{"key":"15","first-page":"264","article-title":"Generalized planted (l,d)-motif problem with negative set","volume":"3692","author":"leung","year":"2005","journal-title":"WABI05 LNBI"},{"key":"16","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1109\/TCBB.2008.103","article-title":"A Monte Carlo EM algorithm for de novo motif discovery in biomolecular sequences","volume":"6","author":"bi","year":"2009","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720006001692"},{"key":"14","first-page":"63","article-title":"An extension and novel solution to the (l,d)-motif challenge problem","volume":"15","author":"styczynski","year":"2004","journal-title":"Genome Informatics"},{"key":"11","first-page":"269","article-title":"Combinatorial approaches to finding subtle signals in DNA sequences","volume":"1","author":"pevzner","year":"0","journal-title":"Proc First ISMB Conference 2000"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1089\/10665270252935430"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"20","first-page":"189","article-title":"Evolutionary Metropolis sampling in sequence alignment space","author":"bi","year":"0","journal-title":"Proc 2008 IEEE Congress on Evolutionary Computation (CEC) 2008"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2021465"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-007-0002-0"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(87)90354-8"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1994.1.337"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.genom.9.081307.164359"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2007.05.009"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1126\/science.1141319"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth1068"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.005"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1541-0420.2006.00625.x"},{"key":"10","first-page":"111","article-title":"Spelling approximate repeated or common motifs using a suffix tree","volume":"1380","author":"sagot","year":"1998","journal-title":"Inform Theory"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1038\/nrg2641"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkn488"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720007002527"},{"key":"6","first-page":"28","article-title":"Fitting a mixture model by expectation maximization to discover motifs in biopolymers","author":"bailey","year":"0","journal-title":"Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology 1994"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1021\/mp7001126"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/prot.340070105"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2006.12.048"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/16.1.16"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1021\/pr070475q"},{"key":"8","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1126\/science.8211139","article-title":"Detecting Subtle Sequence Signals: A Gibbs Sampling Strategy for Multiple Alignment","volume":"262","author":"lawrence","year":"1993","journal-title":"Science"}],"event":{"name":"2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology - Part of 17273 - 2011 Ssci","start":{"date-parts":[[2011,4,11]]},"location":"Paris, France","end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5937063\/5948451\/05948452.pdf?arnumber=5948452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T23:10:38Z","timestamp":1497913838000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5948452\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/cibcb.2011.5948452","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}