{"id":"https://openalex.org/W4386072320","doi":"https://doi.org/10.1109/isit54713.2023.10206475","title":"Union Bound for Generalized Duplication Channels with DTW Decoding","display_name":"Union Bound for Generalized Duplication Channels with DTW Decoding","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386072320","doi":"https://doi.org/10.1109/isit54713.2023.10206475"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","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/A5101490352","display_name":"Adrian Vidal","orcid":"https://orcid.org/0000-0003-0562-8182"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Adrian Vidal","raw_affiliation_strings":["Monash University,Dept. Electrical &#x0026; Computer Systems Engineering,Clayton,VIC,Australia,3800"],"affiliations":[{"raw_affiliation_string":"Monash University,Dept. Electrical &#x0026; Computer Systems Engineering,Clayton,VIC,Australia,3800","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065722383","display_name":"V. B. Wijekoon","orcid":"https://orcid.org/0000-0001-6089-4315"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"V. B. Wijekoon","raw_affiliation_strings":["Monash University,Dept. Electrical &#x0026; Computer Systems Engineering,Clayton,VIC,Australia,3800"],"affiliations":[{"raw_affiliation_string":"Monash University,Dept. Electrical &#x0026; Computer Systems Engineering,Clayton,VIC,Australia,3800","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043667125","display_name":"Emanuele Viterbo","orcid":"https://orcid.org/0000-0002-5861-2873"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Emanuele Viterbo","raw_affiliation_strings":["Monash University,Dept. Electrical &#x0026; Computer Systems Engineering,Clayton,VIC,Australia,3800"],"affiliations":[{"raw_affiliation_string":"Monash University,Dept. Electrical &#x0026; Computer Systems Engineering,Clayton,VIC,Australia,3800","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101490352"],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":1.7514,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.87678924,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"358","last_page":"363"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9970999956130981,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9970999956130981,"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/T12946","display_name":"Fractal and DNA sequence analysis","score":0.9955000281333923,"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9883999824523926,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6587987542152405},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5839991569519043},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.549909234046936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4989602565765381},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.49148786067962646},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46466243267059326},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.459844708442688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4156973361968994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.405517041683197},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1332125961780548}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6587987542152405},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5839991569519043},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.549909234046936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4989602565765381},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.49148786067962646},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46466243267059326},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.459844708442688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4156973361968994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.405517041683197},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1332125961780548}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1946587648","https://openalex.org/W2045191540","https://openalex.org/W2128160875","https://openalex.org/W2791982652","https://openalex.org/W2950993016","https://openalex.org/W3004266179","https://openalex.org/W3096927760","https://openalex.org/W3197362936","https://openalex.org/W4240592325","https://openalex.org/W4289655255","https://openalex.org/W4387869826","https://openalex.org/W6640626097"],"related_works":["https://openalex.org/W88624181","https://openalex.org/W2910428196","https://openalex.org/W2066597241","https://openalex.org/W3203142394","https://openalex.org/W2369939250","https://openalex.org/W4302615923","https://openalex.org/W2129636393","https://openalex.org/W2090054304","https://openalex.org/W98604564","https://openalex.org/W2962814632"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,59,112,144],"calculate":[4,64],"a":[5,55,115,120],"union":[6,66,117],"bound":[7,67,118],"for":[8,75,90],"dynamic":[9],"time":[10,23,74],"warping":[11],"(DTW)-based":[12],"decoding":[13],"of":[14],"piecewise":[15],"constant":[16],"signals":[17,34],"corrupted":[18],"by":[19,134],"additive":[20],"noise":[21],"and":[22,43,79,105],"stretching":[24],"due":[25],"to":[26,132,150],"sample":[27],"duplications,":[28],"as":[29,54],"observed":[30],"in":[31,68,80],"raw":[32],"measurement":[33],"obtained":[35],"from":[36,138],"nanopore":[37],"sequencers.":[38],"We":[39],"consider":[40],"both":[41],"finitely-":[42],"infinitely-supported":[44],"duplications":[45],"with":[46],"geometric-like":[47],"characteristic,":[48],"which":[49],"include":[50],"discrete":[51],"uniform":[52],"distributions":[53],"special":[56],"case.":[57],"First,":[58],"provide":[60],"explicit":[61],"algorithms":[62],"that":[63,114],"the":[65,76,91,97,102,108,124,146],"O(\u03b1k":[69],"<sup":[70,82,86],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[71,83,87],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[72,84,88],")":[73,89],"infinite-support":[77],"case":[78],"O(\u03b2":[81],"k":[85,95],"finite-support":[92],"case,":[93],"where":[94,123],"is":[96,101,107],"codeword":[98],"length,":[99],"\u03b1":[100],"minimum":[103],"duplication,":[104],"\u03b2":[106],"maximum":[109],"duplication.":[110],"Next,":[111],"show":[113],"multi-read":[116],"exhibits":[119],"thresholding":[121],"effect,":[122],"error":[125],"probability":[126],"can":[127],"be":[128],"made":[129],"arbitrarily":[130],"close":[131],"zero":[133],"aggregating":[135],"DTW":[136],"distances":[137],"sufficiently":[139],"many":[140],"independent":[141],"reads.":[142],"Finally,":[143],"validate":[145],"calculated":[147],"bounds":[148],"relative":[149],"simulation":[151],"results.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}