{"id":"https://openalex.org/W2035989640","doi":"https://doi.org/10.1109/itw.2011.6089432","title":"An algorithmic approach for finding deletion correcting codes","display_name":"An algorithmic approach for finding deletion correcting codes","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2035989640","doi":"https://doi.org/10.1109/itw.2011.6089432","mag":"2035989640"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2011.6089432","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","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/A5044008248","display_name":"Farzaneh Khajouei","orcid":"https://orcid.org/0000-0002-0148-9122"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Farzaneh Khajouei","raw_affiliation_strings":["Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801;","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087643858","display_name":"Mahdy Zolghadr","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mahdy Zolghadr","raw_affiliation_strings":["Department of Computer Engineering, Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012789968","display_name":"Negar Kiyavash","orcid":"https://orcid.org/0000-0002-8545-7709"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Negar Kiyavash","raw_affiliation_strings":["Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801;","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3992,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.62163387,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"10","issue":null,"first_page":"25","last_page":"29"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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.9965999722480774,"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/heuristic","display_name":"Heuristic","score":0.6084922552108765},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5181654691696167},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49881935119628906},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49248799681663513},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46989938616752625},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46565893292427063},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45344406366348267},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43204349279403687},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4136177897453308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3892635703086853},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36932575702667236},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08014675974845886}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6084922552108765},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5181654691696167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49881935119628906},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49248799681663513},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46989938616752625},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46565893292427063},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45344406366348267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43204349279403687},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4136177897453308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3892635703086853},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36932575702667236},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08014675974845886},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2011.6089432","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089432","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1647671624","https://openalex.org/W1992539276","https://openalex.org/W2003920341","https://openalex.org/W2060398878","https://openalex.org/W2109386785","https://openalex.org/W2120978458","https://openalex.org/W2137484241","https://openalex.org/W2509017166","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W4360764540","https://openalex.org/W4231657010","https://openalex.org/W2395986200","https://openalex.org/W2007917622","https://openalex.org/W2385305544","https://openalex.org/W2157464222","https://openalex.org/W1985852812","https://openalex.org/W2370815826","https://openalex.org/W1994552539","https://openalex.org/W2433057514"],"abstract_inverted_index":{"A":[0],"general":[1],"construction":[2,47],"for":[3,46],"deletion/insertion":[4],"-":[5],"correcting":[6],"codes":[7,12],"is":[8,29],"proposed":[9],"by":[10],"concatenating":[11],"derived":[13],"from":[14],"a":[15],"heuristic":[16,27],"maximal":[17],"independent":[18],"set":[19],"algorithm":[20,28],"on":[21],"an":[22],"appropriately":[23],"defined":[24],"graph.":[25,40],"Our":[26,54],"polynomial":[30],"with":[31],"respect":[32],"to":[33,75],"the":[34,39],"number":[35],"of":[36,48,60,65],"nodes":[37],"in":[38],"This":[41],"methodology":[42],"may":[43],"be":[44],"used":[45],"any":[49],"length":[50],"n,":[51],"s-deletion":[52],"code.":[53],"experimental":[55],"results":[56],"show":[57],"that":[58],"cardinalities":[59],"our":[61],"codebooks":[62],"exceed":[63],"sizes":[64],"all":[66],"previously":[67],"known":[68],"constructions.":[69],"In":[70],"fact,":[71],"they":[72],"are":[73],"comparable":[74],"Levenshteins":[76],"lower":[77],"bound.":[78]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
