{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:30:45Z","timestamp":1759332645357,"version":"3.28.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:00:00Z","timestamp":1715644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:00:00Z","timestamp":1715644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s12095-024-00718-x","type":"journal-article","created":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T07:02:17Z","timestamp":1715670137000},"page":"1135-1149","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Construction of DNA codes with multiple constrained properties"],"prefix":"10.1007","volume":"16","author":[{"given":"Siddhartha Siddhiprada","family":"Bhoi","sequence":"first","affiliation":[]},{"given":"Udaya","family":"Parampalli","sequence":"additional","affiliation":[]},{"given":"Abhay Kumar","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,14]]},"reference":[{"issue":"6102","key":"718_CR1","doi-asserted-by":"publisher","first-page":"1628","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), 1628\u20131628 (2012)","journal-title":"Science"},{"doi-asserted-by":"crossref","unstructured":"Goldman, N., Bertone, P., Chen, S., Dessimoz, C., LeProust, E.M., Sipos, B., Birney, E.: Towards practical, high-capacity, low maintenance information storage in synthesized DNA. Nature (2013)","key":"718_CR2","DOI":"10.1038\/nature11875"},{"issue":"3","key":"718_CR3","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1109\/TMBMC.2016.2537305","volume":"1","author":"SMHT Yazdi","year":"2015","unstructured":"Yazdi, S.M.H.T., Kiah, H.M., Garcia-Ruiz, E., Ma, J., Zhao, H., Milenkovic, O.: DNA-based storage: trends and methods. IEEE Trans. on Molecular, Biological and Multi-Scale Communications 1(3), 230\u2013248 (2015). https:\/\/doi.org\/10.1109\/TMBMC.2016.2537305","journal-title":"IEEE Trans. on Molecular, Biological and Multi-Scale Communications"},{"unstructured":"Tuan, T.N., Cai, K., Kiah, H.M., Dao, D.T., Schouhamer Immink, K.A.: On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes. arXiv e-prints: arXiv-2302 (2023)","key":"718_CR4"},{"issue":"3","key":"718_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1089\/10665270152530818","volume":"8","author":"A Marathe","year":"2004","unstructured":"Marathe, A., Codon, A.E., Corn, R.M.: On combinatorial DNA word design. J. Comput. Biol. 8(3), 201\u2013219 (2004)","journal-title":"J. Comput. Biol."},{"doi-asserted-by":"publisher","unstructured":"Benerjee, K.G., Banerjee, A.: On DNA codes with multiple constraints. IEEE Commun. Lett. https:\/\/doi.org\/10.1109\/LCOMM.2020.3029071","key":"718_CR6","DOI":"10.1109\/LCOMM.2020.3029071"},{"doi-asserted-by":"crossref","unstructured":"Limbachiya, D., Benerjee, K.G., Rao, B., Gupta, M.K.: On DNA codes using the ring $$Z_4 + wZ_4$$. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA, pp. 2401\u20132405 (2018)","key":"718_CR7","DOI":"10.1109\/ISIT.2018.8437313"},{"unstructured":"Rykov, V.V., Macula, A.J., Torney, D.C., White, P.S.: DNA sequences and quaternary cyclic codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), Washington, DC, USA, USA, pp. 248\u2013248 (2001)","key":"718_CR8"},{"doi-asserted-by":"crossref","unstructured":"International Human Genome Sequencing Consortium: initial sequencing and analysis of the human genome. Nature 409(6822), 860\u2013921 (2001)","key":"718_CR9","DOI":"10.1038\/35057062"},{"doi-asserted-by":"crossref","unstructured":"Kim, Y.S., Kim, S.H.: New construction of DNA codes with constant-GC contents from binary sequences with ideal correlation. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT), St. Petersburg, Russia, pp. 1569\u20131573 (2011)","key":"718_CR10","DOI":"10.1109\/ISIT.2011.6033808"},{"doi-asserted-by":"crossref","unstructured":"Milenkovic, O., Kashyap, N.: On the design of codes for DNA computing. In: Ytrehus (ed.) Coding and Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 100\u2013119 (2006)","key":"718_CR11","DOI":"10.1007\/11779360_9"},{"doi-asserted-by":"publisher","unstructured":"Zuker, M., Sankoff, D.: RNA secondary structures and their prediction. Bulletin of Mathematical Biology 46(4), 591\u2013621 (1984). ISSN 0092-8240, https:\/\/doi.org\/10.1016\/S0092-8240(84)80062-2","key":"718_CR12","DOI":"10.1016\/S0092-8240(84)80062-2"},{"issue":"11","key":"718_CR13","doi-asserted-by":"publisher","first-page":"6309","DOI":"10.1073\/pnas.77.11.6309","volume":"77","author":"R Nussinov","year":"1980","unstructured":"Nussinov, R., Jacobson, A.B.: Fast algorithm for predicting the secondary structure of single-stranded RNA. Natl. Acad. Sci. 77(11), 6309\u20136313 (1980)","journal-title":"Natl. Acad. Sci."},{"key":"718_CR14","volume-title":"Computational molecular biology: an introduction","author":"P Clote","year":"2000","unstructured":"Clote, P., Backofen, R.: Computational molecular biology: an introduction. Wiley Series in Mathematical and Computational Biology, Hoboken, New Jersey, US (2000)"},{"issue":"8","key":"718_CR15","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1109\/LCOMM.2020.2991461","volume":"24","author":"P Mishra","year":"2020","unstructured":"Mishra, P., Bhaya, C., Pal, A.K., Singh, A.K.: Compressed DNA coding using minimum variance Huffman tree. IEEE Commun. Lett. 24(8), 1602\u20131606 (2020). https:\/\/doi.org\/10.1109\/LCOMM.2020.2991461","journal-title":"IEEE Commun. Lett."},{"issue":"10","key":"718_CR16","doi-asserted-by":"publisher","first-page":"1972","DOI":"10.1109\/LCOMM.2018.2861867","volume":"22","author":"D Limbachiya","year":"2018","unstructured":"Limbachiya, D., Gupta, M.K., Aggarwal, V.: Family of constrained codes for archival DNA data storage. IEEE Commun. Lett. 22(10), 1972\u20131975 (2018). https:\/\/doi.org\/10.1109\/LCOMM.2018.2861867","journal-title":"IEEE Commun. Lett."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00718-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00718-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00718-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T23:08:49Z","timestamp":1731971329000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00718-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,14]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["718"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00718-x","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,5,14]]},"assertion":[{"value":"21 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}