{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:42Z","timestamp":1772283702390,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523339","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T11:51:59Z","timestamp":1160567519000},"page":"283-287","source":"Crossref","is-referenced-by-count":10,"title":["New results on DNA codes"],"prefix":"10.1109","author":[{"given":"A.","family":"D'yachkov","sequence":"first","affiliation":[]},{"given":"A.","family":"Macula","sequence":"additional","affiliation":[]},{"given":"T.","family":"Renz","sequence":"additional","affiliation":[]},{"given":"P.","family":"Vilenkin","sequence":"additional","affiliation":[]},{"given":"I.","family":"Ismagilov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","article-title":"A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes","volume":"10","author":"macula","year":"2004","journal-title":"LNCS Proc of DNA"},{"key":"14","article-title":"New insertion-deletion like metrics for DNA hybridization thermodynamic modeling","author":"macula","year":"0","journal-title":"Journal of Computational Biology"},{"key":"11","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/B:JOCO.0000017385.39168.0d","article-title":"Exordium for DNA codes","volume":"7","author":"tomey","year":"2003","journal-title":"Journal of Combinatorial Optimization"},{"key":"12","article-title":"An insertion-deletion like metric with application to DNA hybridization thermodynamic modeling","author":"macula","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"3","first-page":"207","article-title":"Elements of coding theory","author":"levenshtein","year":"1974","journal-title":"Discrete Mathematics and Mathematical Problems of Cybernetics"},{"key":"2","first-page":"707","volume":"10","year":"1966","journal-title":"J Soviet Phys -doklady"},{"key":"1","first-page":"845","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"163","author":"levenshtein","year":"1965","journal-title":"Dokl Akad Nauk USSR"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023642"},{"key":"7","author":"dancik","year":"0","journal-title":"Expected Length of Longest Common Subsequence"},{"key":"6","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","article-title":"Molecular computation of solutions to combinatorial problems","volume":"266","author":"adleman","year":"1994","journal-title":"Science"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056962"},{"key":"4","author":"macwilliams","year":"1977","journal-title":"The Theory of Error - Correcting Codes"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023644"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","location":"Adelaide, Australia","start":{"date-parts":[[2005,9,4]]},"end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523339.pdf?arnumber=1523339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T06:08:23Z","timestamp":1497679703000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523339\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523339","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}