{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T13:39:00Z","timestamp":1648733940101},"reference-count":25,"publisher":"International Academy Publishing (IAP)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"DOI":"10.4304\/jcp.8.3.613-621","type":"journal-article","created":{"date-parts":[[2013,2,27]],"date-time":"2013-02-27T22:45:34Z","timestamp":1362005134000},"source":"Crossref","is-referenced-by-count":1,"title":["A Novel Ant Colony Optimization Based Algorithm for Identifying Gene Regulatory Elements"],"prefix":"10.17706","volume":"8","author":[{"given":"Wei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanwu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2013,3,1]]},"reference":[{"key":"ref1","first-page":"520","article-title":"Extracting regulatory sites from upstream region of yeast genes by computational analysis of oligonucleotide frequencies","volume":"17","author":"van Helden","year":"2001","unstructured":"[1] J.van Helden,B.Ander,and L.Collado-Vides. Extracting regulatory sites from upstream region of yeast genes by computational analysis of oligonucleotide frequencies, J.Mol.Biol., vol.17,pp.520-525,2001.","journal-title":"J Mol Biol","ISSN":"http:\/\/id.crossref.org\/issn\/0022-2836","issn-type":"print"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/16.1.16"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2003-5-1-201"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.bbrc.2003.08.052"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/prot.340070105"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1995.10476622"},{"key":"ref7","article-title":"Very Fast EM-based Mixture Model Clustering Using Multiresolution KD-trees.","author":"Moore","year":"1999","unstructured":"[7] Andrew Moore. Very Fast EM-based Mixture Model Clustering Using Multiresolution KD-trees.Advances in Neural Information Processing Systems,1999.","journal-title":"Adv Neural Inf Process Syst","ISSN":"http:\/\/id.crossref.org\/issn\/1049-5258","issn-type":"print"},{"key":"ref8","first-page":"127","article-title":"BioProspector: discovering conserved DNA motifs in upstream regulatory regions of co-expressed genes.","volume-title":"Proc Pacific Symposium on Biocomputing","author":"Liu","year":"2001","unstructured":"[8] Liu X,Brutlag D,Liu J. BioProspector: discovering conserved DNA motifs in upstream regulatory regions of co-expressed genes.In Proc.Pacific Symposium on Biocomputing,6:127-138,2001."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1089\/10665270252935566"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/15.7.563"},{"key":"ref11","first-page":"28","article-title":"Fitting a mixture model by expectation maximization to discover motifs in biopolymers","volume":"2","author":"Bailey","year":"1994","unstructured":"[11] T.L.Bailey,C.Elkan. Fitting a mixture model by expectation maximization to discover motifs in biopolymers,Proc.Int.Conf.Intell.Syst.Mol.Biol.,2:28-36,1994.","journal-title":"Proc Int Conf Intell Syst Mol Biol","ISSN":"http:\/\/id.crossref.org\/issn\/1553-0833","issn-type":"print"},{"key":"ref12","first-page":"467","article-title":"ANN-Spec:a method for discovering transcription factor binding sites with improved specificity","author":"Workman","year":"2000","unstructured":"[12] C.T.Workman,G.D.Stormo.ANN-Spec:a method for discovering transcription factor binding sites with improved specificity,Pac.Symp.Biocomput.,467\u2013478,2000.","journal-title":"Pac Symp Biocomput","ISSN":"http:\/\/id.crossref.org\/issn\/1793-5091","issn-type":"print"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1089\/10665270252935430"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1038\/nbt717","article-title":"An algorithm for finding protein\u2013DNA binding sites with applications to chromatin-immunoprecipitation microarray experiments","volume":"20","author":"Liu","year":"2002","unstructured":"[14] X.S.Liu,D.L.Brutlag,J.S.Liu. An algorithm for finding protein\u2013DNA binding sites with applications to chromatin-immunoprecipitation microarray experiments, Nat.Biotechnol, 20: 835\u2013839,2002.","journal-title":"Nat Biotechnol","ISSN":"http:\/\/id.crossref.org\/issn\/1087-0156","issn-type":"print"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkg618"},{"issue":"1","key":"ref16","first-page":"56","article-title":"A Novel Hybrid Stochastic Searching Algorithm Based on ACO and PSO: A Case Study of LDR Optimal Design.","volume":"6","author":"Liu","year":"2011","unstructured":"[16] Zhibin Liu, Ling Zhang, Xiangsong Meng. A Novel Hybrid Stochastic Searching Algorithm Based on ACO and PSO: A Case Study of LDR Optimal Design. Journal of Software, 6(1):56~63,2011.","journal-title":"J Softw","ISSN":"http:\/\/id.crossref.org\/issn\/1000-9825","issn-type":"print"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.046"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89674-6_18"},{"issue":"4","key":"ref19","first-page":"584","article-title":"Adaptive Hybrid ant colony optimization for solving Dual Resource Constrained Job Shop Scheduling Problem.","volume":"6","author":"Li","year":"2011","unstructured":"[19] Jingyao Li, Shudong Sun, Yuan Huang. Adaptive Hybrid ant colony optimization for solving Dual Resource Constrained Job Shop Scheduling Problem. Journal of Software, 6(4):584~594,2011.","journal-title":"J Softw","ISSN":"http:\/\/id.crossref.org\/issn\/1000-9825","issn-type":"print"},{"key":"ref20","first-page":"179","article-title":"Thomas St\u00fctzle. Iterated Ants: An Experimental Study for the Quadratic Assignment Problem.","volume-title":"ANTS Workshop","author":"Wiesemann","year":"2006","unstructured":"[20] Wolfram Wiesemann, Thomas St\u00fctzle. Iterated Ants: An Experimental Study for the Quadratic Assignment Problem. ANTS Workshop, 179~190,2006."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00046-7"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1162\/106454606775186400"},{"issue":"11","key":"ref23","first-page":"2201","article-title":"Efficient Intelligent Optimized Algorithm for Dynamic Vehicle Routing Problem.","volume":"6","author":"Wang","year":"2011","unstructured":"[23] Jiangqing Wang, Rongbo Zhu. Efficient Intelligent Optimized Algorithm for Dynamic Vehicle Routing Problem. Journal of Software, 6(11):2201~2208,2011.","journal-title":"J Softw","ISSN":"http:\/\/id.crossref.org\/issn\/1000-9825","issn-type":"print"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/15.7.607"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.86.4.1183"}],"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T04:23:56Z","timestamp":1498019036000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jcp\/article\/view\/9226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,1]]},"references-count":25,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2013,3,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcp.8.3.613-621","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2013,3,1]]}}}