{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:05:54Z","timestamp":1725984354783},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811316470"},{"type":"electronic","value":"9789811316487"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-1648-7_23","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T13:04:38Z","timestamp":1532091878000},"page":"269-278","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Modified Shuffled Frog Leaping Algorithm for Constructing DNA Codes"],"prefix":"10.1007","author":[{"given":"Zhenghui","family":"Liu","sequence":"first","affiliation":[]},{"given":"Bin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Changjun","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Xiaopeng","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,21]]},"reference":[{"issue":"23","key":"23_CR1","doi-asserted-by":"crossref","first-page":"4748","DOI":"10.1093\/nar\/25.23.4748","volume":"25","author":"AG Frutos","year":"1997","unstructured":"Frutos, A.G., Liu, Q., Thiel, A.J., Sanner, A.M., Condon, A.E., Smith, L.M., Corn, R.M.: Demonstration of a word design strategy for DNA computing on surfaces. Nucleic Acids Res. 25(23), 4748\u20134757 (1997)","journal-title":"Nucleic Acids Res."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-44992-2_12","volume-title":"DNA Computing","author":"JH Reif","year":"2001","unstructured":"Reif, J.H., LaBean, T.H., Seeman, N.C.: Challenges and applications for self-assembled DNA nanostructures? In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol. 2054, pp. 173\u2013198. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44992-2_12"},{"issue":"12","key":"23_CR3","doi-asserted-by":"crossref","first-page":"5381","DOI":"10.1073\/pnas.89.12.5381","volume":"89","author":"S Brenner","year":"1992","unstructured":"Brenner, S., Lerner, R.A.: Encoded combinatorial chemistry. Proc. Nat. Acad. Sci. 89(12), 5381\u20135383 (1992)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44992-2_3","volume-title":"DNA Computing","author":"RS Braich","year":"2001","unstructured":"Braich, R.S., et al.: Solution of a satisfiability problem on a gel-based DNA computer. In: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol. 2054, pp. 27\u201342. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44992-2_3"},{"issue":"5235","key":"23_CR5","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1126\/science.270.5235.467","volume":"270","author":"M Schena","year":"1995","unstructured":"Schena, M., Shalon, D., Davis, R.W., Brown, P.O.: Quantitative monitoring of gene expression patterns with a complementary DNA microarray. Science 270(5235), 467\u2013470 (1995)","journal-title":"Science"},{"issue":"15","key":"23_CR6","doi-asserted-by":"crossref","first-page":"4951","DOI":"10.1093\/nar\/gki773","volume":"33","author":"D Tulpan","year":"2005","unstructured":"Tulpan, D., Andronescu, M., Chang, S.B., Shortreed, M.R., Condon, A., Hoos, H.H., Smith, L.M.: Thermodynamically based DNA strand design. Nucleic Acids Res. 33(15), 4951\u20134964 (2005)","journal-title":"Nucleic Acids Res."},{"issue":"7","key":"23_CR7","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1038\/nrg1892","volume":"7","author":"A Condon","year":"2006","unstructured":"Condon, A.: Designed DNA molecules: principles and applications of molecular nanotechnology. Nat. Rev. Genet. 7(7), 565\u2013575 (2006)","journal-title":"Nat. Rev. Genet."},{"key":"23_CR8","unstructured":"Yazdi, S.M.H.T., Yuan, Y., Ma, J., Zhao, H., Milenkovic, O.: A rewritable, random-access DNA-based storage system. arXiv preprint \narXiv:1505.02199\n\n (2015)"},{"issue":"3","key":"23_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1089\/10665270152530818","volume":"8","author":"A Marathe","year":"2001","unstructured":"Marathe, A., Condon, A., Corn, R.M.: On combinatorial DNA word design. J. Comput. Biol. 8(3), 201\u2013219 (2001)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"23_CR10","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1021\/la0112209","volume":"18","author":"L Ming","year":"2002","unstructured":"Ming, L., Lee, H.J., Condon, E.A., Corn, R.M.: DNA word design strategy for creating sets of non-interacting oligonucleotides for DNA microarrays. Langmuir 18(3), 805\u2013812 (2002)","journal-title":"Langmuir"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-36440-4_20","volume-title":"DNA Computing","author":"DC Tulpan","year":"2003","unstructured":"Tulpan, D.C., Hoos, H.H., Condon, A.E.: Stochastic local search algorithms for DNA word design. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 229\u2013241. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-36440-4_20"},{"issue":"1","key":"23_CR12","first-page":"1","volume":"10","author":"OD King","year":"2003","unstructured":"King, O.D.: Bounds for DNA codes with constant GC-content. Electron. J. Comb. 10(1), 1\u201313 (2003)","journal-title":"Electron. J. Comb."},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-44886-1_31","volume-title":"Advances in Artificial Intelligence","author":"DC Tulpan","year":"2003","unstructured":"Tulpan, D.C., Hoos, H.H.: Hybrid randomised neighbourhoods improve stochastic local search for DNA code design. In: Xiang, Y., Chaib-draa, B. (eds.) AI 2003. LNCS, vol. 2671, pp. 418\u2013433. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-44886-1_31"},{"issue":"1","key":"23_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.tcs.2004.11.004","volume":"334","author":"P Gaborit","year":"2005","unstructured":"Gaborit, P., King, O.D.: Linear constructions for DNA codes. Theor. Comput. Sci. 334(1), 99\u2013113 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"23_CR15","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s10852-008-9087-8","volume":"7","author":"R Montemanni","year":"2008","unstructured":"Montemanni, R., Smith, D.H.: Construction of constant GC-content DNA codes via a variable neighbourhood search algorithm. J. Math. Modell. Algorithms 7(3), 311\u2013326 (2008)","journal-title":"J. Math. Modell. Algorithms"},{"issue":"1","key":"23_CR16","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"23_CR17","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TIT.2007.911167","volume":"54","author":"YM Chee","year":"2008","unstructured":"Chee, Y.M., Ling, S.: Improved lower bounds for constant GC-content DNA codes. IEEE Trans. Inf. Theor. 54(1), 391\u2013394 (2008)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"23_CR18","unstructured":"Niema, A.: The construction of DNA codes using a computer algebra system. Ph.D thesis. University of Glamorgan (2011)"},{"key":"23_CR19","first-page":"167","volume":"6","author":"R Montemanni","year":"2014","unstructured":"Montemanni, R., Smith, D.H., Koul, N.: Three metaheuristics for the construction of constant GC-content DNA codes. Lect. Notes Manage. Sci. 6, 167\u2013175 (2014)","journal-title":"Lect. Notes Manage. Sci."},{"issue":"2","key":"23_CR20","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/TCBB.2014.2299815","volume":"11","author":"D Tulpan","year":"2014","unstructured":"Tulpan, D., Smith, D.H., Montemanni, R.: Thermodynamic post-processing versus GC-content pre-processing for DNA codes satisfying the hamming distance and reverse-complement constraints. IEEE\/ACM Trans. Comput. Biol. Bioinf. 11(2), 441\u2013452 (2014)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"2","key":"23_CR21","first-page":"203","volume":"10","author":"Z Varbanov","year":"2014","unstructured":"Varbanov, Z., Todorov, T., Hristova, M.: A method for constructing DNA codes from additive self-dual codes over GF (4). ROMAI J. 10(2), 203\u2013211 (2014)","journal-title":"ROMAI J."},{"key":"23_CR22","unstructured":"Limbachiya, D., Rao, B., Gupta, M.K.: The art of DNA strings: sixteen years of DNA coding theory. arXiv preprint \narXiv:1607.00266\n\n (2016)"},{"issue":"3","key":"23_CR23","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)","volume":"129","author":"MM Eusuff","year":"2003","unstructured":"Eusuff, M.M., Lansey, K.E.: Optimization of water distribution network design using the shuffled frog leaping algorithm. J. Water Resour. Plan. Manage. 129(3), 210\u2013225 (2003)","journal-title":"J. Water Resour. Plan. Manage."},{"key":"23_CR24","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/j.asoc.2014.02.010","volume":"19","author":"KK Bhattacharjee","year":"2014","unstructured":"Bhattacharjee, K.K., Sarmah, S.P.: Shuffled frog leaping algorithm and its application to 0\/1 knapsack problem. Appl. Soft Comput. 19, 252\u2013263 (2014)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"23_CR25","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S1665-6423(14)71611-6","volume":"12","author":"A Darvishi","year":"2014","unstructured":"Darvishi, A., Alimardani, A., Vahidi, B., Hosseinian, S.: Shuffled frog-leaping algorithm for control of selective and total harmonic distortion. J. Appl. Res. Technol. 12(1), 111\u2013121 (2014)","journal-title":"J. Appl. Res. Technol."},{"key":"23_CR26","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/j.ijepes.2014.07.073","volume":"64","author":"M Jadidoleslam","year":"2015","unstructured":"Jadidoleslam, M., Ebrahimi, A.: Reliability constrained generation expansion planning by a modified shuffled frog leaping algorithm. Int. J. Electr. Power Energy Syst. 64, 743\u2013751 (2015)","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"5","key":"23_CR27","doi-asserted-by":"crossref","first-page":"182","DOI":"10.3390\/w8050182","volume":"8","author":"D Moramelia","year":"2016","unstructured":"Moramelia, D., Iglesiasrey, P.L., Martinezsolano, F., Munozvelasco, P.: The efficiency of setting parameters in a modified shuffled frog leaping algorithm applied to optimizing water distribution networks. Water 8(5), 182 (2016)","journal-title":"Water"},{"issue":"10","key":"23_CR28","doi-asserted-by":"crossref","first-page":"06016008","DOI":"10.1061\/(ASCE)IR.1943-4774.0001059","volume":"142","author":"H Orouji","year":"2016","unstructured":"Orouji, H., Mahmoudi, N., Fallah-Mehdipour, E., Pazoki, M., Biswas, A.: Shuffled frog-leaping algorithm for optimal design of open channels. J. Irrig. Drain. Eng. 142(10), 06016008 (2016)","journal-title":"J. Irrig. Drain. Eng."}],"container-title":["Communications in Computer and Information Science","Computational Intelligence and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-1648-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T13:15:20Z","timestamp":1532092520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-1648-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811316470","9789811316487"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-1648-7_23","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}