{"id":"https://openalex.org/W2998466234","doi":"https://doi.org/10.1145/3338514","title":"Deciding the Confusability of Words under Tandem Repeats in Linear Time","display_name":"Deciding the Confusability of Words under Tandem Repeats in Linear Time","publication_year":2019,"publication_date":"2019-07-16","ids":{"openalex":"https://openalex.org/W2998466234","doi":"https://doi.org/10.1145/3338514","mag":"2998466234"},"language":"en","primary_location":{"id":"doi:10.1145/3338514","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3338514","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5088037430","display_name":"Yeow Meng Chee","orcid":"https://orcid.org/0000-0001-7823-8068"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Yeow Meng Chee","raw_affiliation_strings":["National University of Singapore, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014193799","display_name":"Johan Chrisnata","orcid":"https://orcid.org/0000-0003-1705-9597"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Johan Chrisnata","raw_affiliation_strings":["Nanyang Technological University, Nanyang Link, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Nanyang Link, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083157397","display_name":"Han Mao Kiah","orcid":"https://orcid.org/0000-0001-5611-0848"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Han Mao Kiah","raw_affiliation_strings":["Nanyang Technological University, Nanyang Link, Singapore"],"raw_orcid":"https://orcid.org/0000-0001-5611-0848","affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Nanyang Link, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081533260","display_name":"Tuan Thanh Nguyen","orcid":"https://orcid.org/0000-0002-3179-9471"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Tuan Thanh Nguyen","raw_affiliation_strings":["Nanyang Technological University, Nanyang Link, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Nanyang Link, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5088037430"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":1.8861,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.89719526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"15","issue":"3","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994000196456909,"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.9994000196456909,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9984999895095825,"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/undecidable-problem","display_name":"Undecidable problem","score":0.7963848114013672},{"id":"https://openalex.org/keywords/tandem-repeat","display_name":"Tandem repeat","score":0.6199210286140442},{"id":"https://openalex.org/keywords/tandem","display_name":"Tandem","score":0.5971199870109558},{"id":"https://openalex.org/keywords/gene-duplication","display_name":"Gene duplication","score":0.5548070669174194},{"id":"https://openalex.org/keywords/tandem-exon-duplication","display_name":"Tandem exon duplication","score":0.5501455068588257},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5159183740615845},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4969189465045929},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4863319993019104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47316938638687134},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46992170810699463},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4607139527797699},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.45198193192481995},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4189281165599823},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3991824984550476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39243394136428833},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32641446590423584},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.1235727071762085},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.10467904806137085},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.08084344863891602},{"id":"https://openalex.org/keywords/genome","display_name":"Genome","score":0.07991394400596619}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7963848114013672},{"id":"https://openalex.org/C27149982","wikidata":"https://www.wikidata.org/wiki/Q3456514","display_name":"Tandem repeat","level":4,"score":0.6199210286140442},{"id":"https://openalex.org/C2777814067","wikidata":"https://www.wikidata.org/wiki/Q1752317","display_name":"Tandem","level":2,"score":0.5971199870109558},{"id":"https://openalex.org/C7602840","wikidata":"https://www.wikidata.org/wiki/Q746284","display_name":"Gene duplication","level":3,"score":0.5548070669174194},{"id":"https://openalex.org/C156446351","wikidata":"https://www.wikidata.org/wiki/Q7682435","display_name":"Tandem exon duplication","level":4,"score":0.5501455068588257},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5159183740615845},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4969189465045929},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4863319993019104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47316938638687134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46992170810699463},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4607139527797699},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.45198193192481995},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4189281165599823},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3991824984550476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39243394136428833},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32641446590423584},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.1235727071762085},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.10467904806137085},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.08084344863891602},{"id":"https://openalex.org/C141231307","wikidata":"https://www.wikidata.org/wiki/Q7020","display_name":"Genome","level":3,"score":0.07991394400596619},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3338514","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3338514","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7396299046","display_name":null,"funder_award_id":"MOE2015-T2-2-086","funder_id":"https://openalex.org/F4320320751","funder_display_name":"Ministry of Education - Singapore"}],"funders":[{"id":"https://openalex.org/F4320320751","display_name":"Ministry of Education - Singapore","ror":"https://ror.org/01kcva023"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W88717455","https://openalex.org/W1501398917","https://openalex.org/W1994584977","https://openalex.org/W2001496424","https://openalex.org/W2012120492","https://openalex.org/W2065247540","https://openalex.org/W2080892263","https://openalex.org/W2109234462","https://openalex.org/W2111921000","https://openalex.org/W2118390049","https://openalex.org/W2139836098","https://openalex.org/W2145960764","https://openalex.org/W2168909179","https://openalex.org/W2183091601","https://openalex.org/W2601746657","https://openalex.org/W2735589681","https://openalex.org/W2738842617"],"related_works":["https://openalex.org/W4287814523","https://openalex.org/W3105069054","https://openalex.org/W2735950571","https://openalex.org/W2054730971","https://openalex.org/W1988020497","https://openalex.org/W1544871822","https://openalex.org/W2998466234","https://openalex.org/W2949252441","https://openalex.org/W4287817538","https://openalex.org/W3138056180"],"abstract_inverted_index":{"Tandem":[0],"duplication":[1,80],"in":[2,27],"DNA":[3,15],"is":[4,81,111,113,131,143],"the":[5,18,35,45,55,90,104,128,153,157,164,179,184,212],"process":[6],"of":[7,11,14,37,47,57,72,82,106,159,186,214],"inserting":[8],"a":[9,12,70,117],"copy":[10],"segment":[13],"adjacent":[16],"to":[17,43,64,178,193,198,222],"original":[19],"position.":[20],"Motivated":[21],"by":[22],"applications":[23],"that":[24,39,89,103,119,140],"store":[25],"data":[26,48],"living":[28],"organisms,":[29],"Jain":[30],"et":[31],"al.":[32],"(2016)":[33],"proposed":[34],"study":[36,56,156],"codes":[38,172,189,201,217],"correct":[40],"tandem":[41,73],"duplications":[42,74,95],"improve":[44,163],"reliability":[46],"storage.":[49],"We":[50,138,162,182],"investigate":[51],"algorithms":[52],"associated":[53],"with":[54,125,173],"these":[58],"codes.":[59,161],"Two":[60],"words":[61,93,110],"are":[62,96],"said":[63],"be":[65,121],"\u2a7d-confusable":[66],"if":[67],"there":[68],"exists":[69],"sequence":[71],"for":[75,134,145,190,202,211,218],"each":[76,79],"word,":[77],"where":[78],"length":[83],"at":[84],"most":[85],"k":[86,99,135,146],",":[87],"such":[88],"resulting":[91],"two":[92,109],"after":[94],"equal.":[97],"For":[98],"=3,":[100],"we":[101,155],"demonstrate":[102],"problem":[105,130,142],"deciding":[107],"whether":[108],"\u2a7d3-confusable":[112],"linear-time":[114,132],"solvable":[115,133],"through":[116],"characterisation":[118],"can":[120],"checked":[122],"efficiently.":[123],"Combining":[124],"previous":[126,165,180],"results,":[127],"decision":[129],"\u2a7d":[136],"3.":[137,148],"conjecture":[139],"this":[141],"undecidable":[144],">":[147],"Using":[149],"insights":[150],"gained":[151],"from":[152,220],"algorithm,":[154],"size":[158,213],"tandem-duplication":[160,188,200,216],"known":[166],"upper":[167],"bound":[168],"and":[169,206],"then":[170],"construct":[171,199],"larger":[174],"sizes":[175,185],"as":[176],"compared":[177],"constructions.":[181],"determine":[183],"optimal":[187,215],"lengths":[191,219],"up":[192],"20,":[194],"develop":[195],"recursive":[196],"methods":[197],"all":[203],"word":[204],"lengths,":[205],"compute":[207],"explicit":[208],"lower":[209],"bounds":[210],"21":[221],"30.":[223]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}