{"id":"https://openalex.org/W7127310741","doi":"https://doi.org/10.48550/arxiv.2602.01151","title":"On the Palindromic/Reverse-Complement Duplication Correcting Codes","display_name":"On the Palindromic/Reverse-Complement Duplication Correcting Codes","publication_year":2026,"publication_date":"2026-02-01","ids":{"openalex":"https://openalex.org/W7127310741","doi":"https://doi.org/10.48550/arxiv.2602.01151"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.01151","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124915676","display_name":"Yubo Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sun, Yubo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5124897439","display_name":"Gennian Ge","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ge, Gennian","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5124915676"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.7084000110626221,"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":0.7084000110626221,"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.0406000018119812,"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"}},{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.0364999994635582,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/palindrome","display_name":"Palindrome","score":0.7257000207901001},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.7124000191688538},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5720999836921692},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5070000290870667},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41029998660087585},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.41019999980926514},{"id":"https://openalex.org/keywords/gene-duplication","display_name":"Gene duplication","score":0.3831000030040741}],"concepts":[{"id":"https://openalex.org/C44667518","wikidata":"https://www.wikidata.org/wiki/Q12321","display_name":"Palindrome","level":4,"score":0.7257000207901001},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.7124000191688538},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5720999836921692},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5070000290870667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.475600004196167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46639999747276306},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43220001459121704},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41029998660087585},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.41019999980926514},{"id":"https://openalex.org/C7602840","wikidata":"https://www.wikidata.org/wiki/Q746284","display_name":"Gene duplication","level":3,"score":0.3831000030040741},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.3580999970436096},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.3546000123023987},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.34929999709129333},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2728999853134155},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27000001072883606},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.258899986743927},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2572999894618988}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.01151","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.01151","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.01151","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.01151","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Motivated":[0],"by":[1,116],"applications":[2],"in":[3],"in-vivo":[4],"DNA":[5],"storage,":[6],"we":[7,89,129],"study":[8],"codes":[9,95,135],"for":[10,94,125],"correcting":[11,63],"duplications.":[12,142],"A":[13],"reverse-complement":[14,68,100,141],"duplication":[15,42,101],"of":[16,22,28,31,62,67,105,134,149,171,183],"length":[17,32,78],"$k$":[18,33],"is":[19,113],"the":[20,23,45,110],"insertion":[21],"reversed":[24,46],"and":[25,85,159,180],"complemented":[26],"copy":[27,47],"a":[29,40,57,91,99,147],"substring":[30],"adjacent":[34],"to":[35],"its":[36],"original":[37],"position,":[38],"while":[39],"palindromic":[41,71,103],"only":[43],"inserts":[44],"without":[48],"complementation.":[49],"We":[50],"first":[51,144],"construct":[52],"an":[53,64,168],"explicit":[54,132],"code":[55],"with":[56,155,178],"single":[58],"redundant":[59],"symbol":[60],"capable":[61],"arbitrary":[65,106],"number":[66],"duplications":[69,76],"(respectively,":[70,102],"duplications),":[72],"provided":[73],"that":[74,96,109,136],"all":[75],"have":[77],"$k":[79],"\\ge":[80,127],"3\\lceil":[81],"\\log_q":[82],"n":[83,118,121,151,173],"\\rceil$":[84],"are":[86],"disjoint.":[87],"Next,":[88],"derive":[90],"Gilbert-Varshamov":[92],"bound":[93],"can":[97,137],"correct":[98,138],"duplication)":[104],"length,":[107],"showing":[108],"optimal":[111],"redundancy":[112,148,170],"upper":[114],"bounded":[115],"$2\\log_q":[117],"+":[119,122,152,174],"\\log_q\\log_q":[120],"O(1)$.":[123],"Finally,":[124],"$q":[126],"4$,":[128],"present":[130],"two":[131],"constructions":[133],"$t$":[139],"length-one":[140],"The":[143,164],"construction":[145,166],"achieves":[146,167],"$2t\\log_q":[150],"O(\\log_q\\log_q":[153,175],"n)$":[154],"encoding":[156,179],"complexity":[157,161],"$O(n)$":[158],"decoding":[160,181],"$O\\big(n(\\log_2":[162],"n)^4\\big)$.":[163],"second":[165],"improved":[169],"$(2t-1)\\log_q":[172],"n)$,":[176],"but":[177],"complexities":[182],"$O\\big(n":[184],"\\cdot":[185],"\\mathrm{poly}(\\log_2":[186],"n)\\big)$.":[187]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-04T00:00:00"}