{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T14:27:18Z","timestamp":1759588038102},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T00:00:00Z","timestamp":1553126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s00200-019-00386-y","type":"journal-article","created":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:18:01Z","timestamp":1553156281000},"page":"207-216","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Greedy construction of DNA codes and new bounds"],"prefix":"10.1007","volume":"30","author":[{"given":"Nabil","family":"Bennenni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenza","family":"Guenda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas Aaron","family":"Gulliver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,21]]},"reference":[{"issue":"5","key":"386_CR1","doi-asserted-by":"publisher","first-page":"1062","DOI":"10.1016\/j.disc.2011.11.021","volume":"312","author":"N Aboluion","year":"2012","unstructured":"Aboluion, N., Smith, D.H., Perkins, S.: Linear and nonlinear constructions of DNA codes with Hamming distance d, constant GC-content and a reverse-complement constraint. Discrete Math. 312(5), 1062\u20131075 (2012)","journal-title":"Discrete Math."},{"issue":"8","key":"386_CR2","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1089\/cmb.2007.0083","volume":"14","author":"MA Bishop","year":"2007","unstructured":"Bishop, M.A., D\u2019Yachkov, A.G., Macula, A.J., Renz, T.E., Rykov, V.V.: Free energy gap and statistical thermodynamic fidelity of DNA codes. J. Comput. Biol. 14(8), 1088\u20131104 (2007)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"386_CR3","doi-asserted-by":"publisher","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. Theory. 54(1), 391\u2013394 (2008)","journal-title":"IEEE Trans. Inf. Theory."},{"issue":"6102","key":"386_CR4","doi-asserted-by":"publisher","first-page":"16281628","DOI":"10.1126\/science.1226355","volume":"337","author":"GM Church","year":"2012","unstructured":"Church, G.M., Gao, Y., Kosuri, S.: Next-generation digital information storage in DNA. Science 337(6102), 16281628 (2012)","journal-title":"Science"},{"key":"386_CR5","doi-asserted-by":"publisher","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, 99\u2013113 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"386_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1038\/nature11875","volume":"494","author":"N Goldman","year":"2013","unstructured":"Goldman, N., Bertone, P., Chen, S., Dessimoz, C., LeProust, E.M., Sipos, B., Birnery, E.: Towards practical, high-capacity, low-maintenance information storage in synthesized DNA. Nature 494, 77 (2013)","journal-title":"Nature"},{"key":"386_CR7","first-page":"25522555","volume":"54","author":"RN Grass","year":"2015","unstructured":"Grass, R.N., Henckel, R., Puddu, M., Paunescu, D., Stark, W.J.: Robust chemical preservation of digital information on DNA in silica with error-correcting codes. Angew. Chem. Int. Ed. 54, 25522555 (2015)","journal-title":"Angew. Chem. Int. Ed."},{"key":"386_CR8","doi-asserted-by":"crossref","unstructured":"Guenda, K., Gulliver, T.A., Sol\u00e9, P.: On cyclic DNA codes. In: Proc. IEEE Int. Symp. Inform. Theory, Istanbul, pp. 121\u2013125 (2013)","DOI":"10.1109\/ISIT.2013.6620200"},{"issue":"3","key":"386_CR9","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/s10623-012-9791-2","volume":"72","author":"K Guenda","year":"2014","unstructured":"Guenda, K., Gulliver, T.A., Sheikholeslam, S.A.: Lexicodes over rings. Des. Codes Cryptogr. 72(3), 749\u2013763 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"386_CR10","unstructured":"Kiah, H.M., Puleo, G.J., Milenkovic, O.: Codes for DNA sequence profiles (2015). ArXiv preprint \n                    arXiv:1502.00517"},{"key":"386_CR11","doi-asserted-by":"crossref","first-page":"R33","DOI":"10.37236\/1726","volume":"10","author":"OD King","year":"2003","unstructured":"King, O.D.: Bounds for DNA codes with constant GC-content. Electron. J. Comb. 10, R33 (2003)","journal-title":"Electron. J. Comb."},{"key":"386_CR12","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.tcs.2012.12.030","volume":"494","author":"M-Y Kao","year":"2013","unstructured":"Kao, M.-Y., Leung, H.C.M., Sun, H., Zhang, Y.: Deterministic polynomial-time algorithms for designing short DNA words. Theor. Comput. Sci. 494, 144\u2013160 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"386_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1089\/10665270152530818","volume":"8","author":"A Marathe","year":"2001","unstructured":"Marathe, A., Condon, A.E., Corn, R.M.: On combinatorial DNA word design. J. Comput. Biol. 8(3), 201\u2013219 (2001)","journal-title":"J. Comput. Biol."},{"key":"386_CR14","doi-asserted-by":"crossref","unstructured":"Milenkovic, O., Kashyap, N.: On the design of the codes for DNA computing. In: WCC 2005, LNCS, vol. 39, pp. 100\u2013119 (2006)","DOI":"10.1007\/11779360_9"},{"key":"386_CR15","doi-asserted-by":"publisher","first-page":"31","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. Model. Algorithm 7, 31\u2013326 (2008)","journal-title":"J. Math. Model. Algorithm"},{"issue":"5","key":"386_CR16","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/34.682181","volume":"20","author":"ES Ristad","year":"1998","unstructured":"Ristad, E.S., Yianilos, P.N.: Learning string-edit distance. IEEE Trans. Anal. Mach. Intell. 20(5), 522\u2013532 (1998)","journal-title":"IEEE Trans. Anal. Mach. Intell."},{"key":"386_CR17","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1038\/ng1296-450","volume":"14","author":"DD Shoemaker","year":"1996","unstructured":"Shoemaker, D.D., Lashkari, D.A., Morris, D., Mittman, M., Davis, R.W.: Quantitative phenotypic analysis of yeast deletion mutant using a highly parallel molecular bar-coding strategy. Nat. Genet. 14, 450\u2013456 (1996)","journal-title":"Nat. Genet."},{"issue":"13","key":"386_CR18","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1016\/j.disc.2010.03.005","volume":"311","author":"DH Smith","year":"2011","unstructured":"Smith, D.H., Aboluion, N., Montemanni, H., Perkins, S.: Linear and nonlinear constructions of DNA codes with Hamming distance d and constant GC-content. Discretre Math. 311(13), 1207\u20131219 (2011)","journal-title":"Discretre Math."},{"key":"386_CR19","unstructured":"Sun, J.: Bounds on edit metric codes with combinatorial DNA constraints. Master\u2019s Thesis, Brock University (2009)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00386-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-019-00386-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-019-00386-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T00:09:37Z","timestamp":1584662977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-019-00386-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,21]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["386"],"URL":"https:\/\/doi.org\/10.1007\/s00200-019-00386-y","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,21]]},"assertion":[{"value":"13 September 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}