{"id":"https://openalex.org/W1964876021","doi":"https://doi.org/10.1109/isit.2005.1523339","title":"New results on DNA codes","display_name":"New results on DNA codes","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W1964876021","doi":"https://doi.org/10.1109/isit.2005.1523339","mag":"1964876021"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044988387","display_name":"A.G. D'yachkov","orcid":null},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"A. D'yachkov","raw_affiliation_strings":["Department of Probability Theory, Moscow State University, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Probability Theory, Moscow State University, Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110053397","display_name":"A. Macula","orcid":null},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"A. Macula","raw_affiliation_strings":["Air Force Res. Lab. IFTC, Rome Research Site, Rome, NY, USA","Faculty of Mechanics and Mathematics, Moscow State University, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Air Force Res. Lab. IFTC, Rome Research Site, Rome, NY, USA","institution_ids":[]},{"raw_affiliation_string":"Faculty of Mechanics and Mathematics, Moscow State University, Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109253350","display_name":"Thomas E. Renz","orcid":null},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"T. Renz","raw_affiliation_strings":["Air Force Res. Lab. IFTC, Rome Research Site, Rome, NY, USA","Faculty of Mechanics and Mathematics, Moscow State University, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Air Force Res. Lab. IFTC, Rome Research Site, Rome, NY, USA","institution_ids":[]},{"raw_affiliation_string":"Faculty of Mechanics and Mathematics, Moscow State University, Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084160282","display_name":"P.A. Vilenkin","orcid":null},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"P. Vilenkin","raw_affiliation_strings":["Department of Probability Theory, Moscow State University, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Probability Theory, Moscow State University, Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014613390","display_name":"I. K. Ismagilov","orcid":null},"institutions":[{"id":"https://openalex.org/I19880235","display_name":"Lomonosov Moscow State University","ror":"https://ror.org/010pmpe69","country_code":"RU","type":"education","lineage":["https://openalex.org/I19880235"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"I. Ismagilov","raw_affiliation_strings":["Department of Probability Theory, Moscow State University, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Department of Probability Theory, Moscow State University, Moscow, Russia","institution_ids":["https://openalex.org/I19880235"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5044988387"],"corresponding_institution_ids":["https://openalex.org/I19880235"],"apc_list":null,"apc_paid":null,"fwci":0.6329,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.65067979,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"283","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.7046235799789429},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6908530592918396},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.6225296854972839},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5407668352127075},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.4665740728378296},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.43316757678985596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4228060245513916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42268359661102295},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.40130555629730225},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39399898052215576},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33541208505630493},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.14343580603599548},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11749988794326782}],"concepts":[{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.7046235799789429},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6908530592918396},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.6225296854972839},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5407668352127075},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.4665740728378296},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.43316757678985596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4228060245513916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42268359661102295},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.40130555629730225},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39399898052215576},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33541208505630493},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.14343580603599548},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11749988794326782},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2005.1523339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},{"id":"pmh:ADA448720","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA448720","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1517422340","https://openalex.org/W1606480398","https://openalex.org/W1606584921","https://openalex.org/W1647671624","https://openalex.org/W1777578226","https://openalex.org/W1964440534","https://openalex.org/W1969151232","https://openalex.org/W1977312644","https://openalex.org/W1989718898","https://openalex.org/W2081354249","https://openalex.org/W2115151682","https://openalex.org/W2168350517","https://openalex.org/W4246486136","https://openalex.org/W4285719527","https://openalex.org/W6636915900"],"related_works":["https://openalex.org/W25732909","https://openalex.org/W4323338832","https://openalex.org/W4289596129","https://openalex.org/W3083981518","https://openalex.org/W4225868058","https://openalex.org/W1999879627","https://openalex.org/W2088055539","https://openalex.org/W1574834681","https://openalex.org/W2389167168","https://openalex.org/W2125814644"],"abstract_inverted_index":{"For":[0],"q-ary":[1,41],"n-sequences,":[2],"we":[3],"develop":[4],"the":[5,32,76,83,100,127,134],"concept":[6],"of":[7,34,85,91,102,115,121],"similarity":[8,22,27,46,79,110,114],"functions":[9,47],"that":[10,64],"can":[11],"be":[12],"used":[13,81],"(for":[14],"q":[15],"=":[16],"4)":[17],"to":[18,95],"model":[19],"a":[20,35,107,113],"thermodynamic":[21],"on":[23,45,99,126],"DNA":[24,50,52,66,104,123],"sequences.":[25],"A":[26],"function":[28,80,111],"is":[29],"identified":[30],"by":[31],"length":[33],"longest":[36],"common":[37],"subsequence":[38],"between":[39],"two":[40],"n-sequences.":[42],"Codes":[43],"based":[44,125],"are":[48,54],"called":[49,112],"codes.":[51,87],"codes":[53,105,124],"important":[55],"components":[56],"in":[57,82,133],"biomolecular":[58],"computing":[59],"and":[60],"other":[61],"biotechnical":[62],"applications":[63],"employ":[65],"hybridization":[67],"assays.":[68],"We":[69,117],"present":[70,119],"our":[71],"unpublished":[72],"results":[73],"connected":[74],"with":[75],"conventional":[77],"deletion":[78],"theory":[84],"error-correcting":[86],"The":[88],"main":[89],"aim":[90],"this":[92],"paper":[93],"-":[94],"obtain":[96],"lower":[97],"bounds":[98],"rate":[101],"optimal":[103],"for":[106],"biologically":[108],"motivated":[109],"blocks.":[116],"also":[118],"constructions":[120],"suboptimal":[122],"parity-check":[128],"code":[129],"detecting":[130],"one":[131],"error":[132],"Hamming":[135],"metric":[136]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}