{"id":"https://openalex.org/W2083687743","doi":"https://doi.org/10.1142/s0129054105003789","title":"ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS","display_name":"ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W2083687743","doi":"https://doi.org/10.1142/s0129054105003789","mag":"2083687743"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003789","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003789","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://libres.uncg.edu/ir/uncg/f/F_Blanchet-Sadri_Algorithms_2005.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100461215","display_name":"Lili Zhang","orcid":"https://orcid.org/0000-0003-1935-4223"},"institutions":[{"id":"https://openalex.org/I169335092","display_name":"University of North Carolina at Greensboro","ror":"https://ror.org/04fnxsj42","country_code":"US","type":"education","lineage":["https://openalex.org/I169335092"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"LILI ZHANG","raw_affiliation_strings":["Department of Mathematical Sciences,  University of North Carolina, P. O. Box 26170,  Greensboro, North Carolina 27402\u20136170, United States"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences,  University of North Carolina, P. O. Box 26170,  Greensboro, North Carolina 27402\u20136170, United States","institution_ids":["https://openalex.org/I169335092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034611719","display_name":"F. Blanchet-Sadri","orcid":null},"institutions":[{"id":"https://openalex.org/I169335092","display_name":"University of North Carolina at Greensboro","ror":"https://ror.org/04fnxsj42","country_code":"US","type":"education","lineage":["https://openalex.org/I169335092"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F. BLANCHET-SADRI","raw_affiliation_strings":["Department of Mathematical Sciences,  University of North Carolina, P.O. Box 26170, Greensboro,  North Carolina 27402\u20136170, United States"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences,  University of North Carolina, P.O. Box 26170, Greensboro,  North Carolina 27402\u20136170, United States","institution_ids":["https://openalex.org/I169335092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100461215"],"corresponding_institution_ids":["https://openalex.org/I169335092"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.12500937,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":"06","first_page":"1231","last_page":"1251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11567","display_name":"semigroups and automata theory","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/edit-distance","display_name":"Edit distance","score":0.91102135181427},{"id":"https://openalex.org/keywords/levenshtein-distance","display_name":"Levenshtein distance","score":0.7865909337997437},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7180873155593872},{"id":"https://openalex.org/keywords/approximate-string-matching","display_name":"Approximate string matching","score":0.5471504926681519},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5262348055839539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5145255923271179},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.474596232175827},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44884783029556274},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.42590904235839844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4186391234397888},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.413971483707428},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4126232862472534},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41078490018844604},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37782803177833557},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.20036065578460693},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09794086217880249}],"concepts":[{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.91102135181427},{"id":"https://openalex.org/C2777515626","wikidata":"https://www.wikidata.org/wiki/Q496939","display_name":"Levenshtein distance","level":2,"score":0.7865909337997437},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7180873155593872},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.5471504926681519},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5262348055839539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5145255923271179},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.474596232175827},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44884783029556274},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.42590904235839844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4186391234397888},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.413971483707428},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4126232862472534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41078490018844604},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37782803177833557},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.20036065578460693},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09794086217880249},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"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/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054105003789","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003789","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:libres.uncg.edu/5146","is_oa":true,"landing_page_url":null,"pdf_url":"http://libres.uncg.edu/ir/uncg/f/F_Blanchet-Sadri_Algorithms_2005.pdf","source":{"id":"https://openalex.org/S4306401856","display_name":"NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169335092","host_organization_name":"University of North Carolina at Greensboro","host_organization_lineage":["https://openalex.org/I169335092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:libres.uncg.edu/5146","is_oa":true,"landing_page_url":null,"pdf_url":"http://libres.uncg.edu/ir/uncg/f/F_Blanchet-Sadri_Algorithms_2005.pdf","source":{"id":"https://openalex.org/S4306401856","display_name":"NC Digital Online Collection of Knowledge and Scholarship (The University of North Carolina at Greensboro)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I169335092","host_organization_name":"University of North Carolina at Greensboro","host_organization_lineage":["https://openalex.org/I169335092"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5920221254","display_name":null,"funder_award_id":"020767","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7243155797","display_name":"RUI: Computing Patterns in Strings","funder_award_id":"0207673","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2083687743.pdf","grobid_xml":"https://content.openalex.org/works/W2083687743.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W63662079","https://openalex.org/W109065635","https://openalex.org/W1589993665","https://openalex.org/W1979205601","https://openalex.org/W1981523680","https://openalex.org/W1995705893","https://openalex.org/W2000630039","https://openalex.org/W2024070750","https://openalex.org/W2056819372","https://openalex.org/W2056972845","https://openalex.org/W2060296641","https://openalex.org/W2074231493","https://openalex.org/W2084345246"],"related_works":["https://openalex.org/W2461708070","https://openalex.org/W4280559639","https://openalex.org/W4285090010","https://openalex.org/W2399644331","https://openalex.org/W52396946","https://openalex.org/W2950268498","https://openalex.org/W2405436873","https://openalex.org/W2187092961","https://openalex.org/W1604047596","https://openalex.org/W2050554337"],"abstract_inverted_index":{"Computing":[0],"approximate":[1,27,75],"patterns":[2],"in":[3,10],"strings":[4,55],"or":[5],"sequences":[6],"has":[7,116],"important":[8],"applications":[9],"DNA":[11],"sequence":[12],"analysis,":[13,18],"data":[14],"compression,":[15],"musical":[16],"text":[17],"and":[19,29,59,99,106],"so":[20],"on.":[21],"In":[22],"this":[23,84],"paper,":[24],"we":[25,86],"introduce":[26],"k-covers":[28,76],"study":[30],"them":[31],"under":[32,103],"various":[33],"commonly":[34],"used":[35],"distance":[36,61,80],"measures.":[37],"We":[38],"propose":[39],"the":[40,64,124],"following":[41],"problem:":[42],"\"Given":[43],"a":[44,50,60,72],"string":[45],"x":[46,78],"of":[47,53,56,74,123],"length":[48,57],"n,":[49],"set":[51,73],"U":[52,70],"m":[54],"k,":[58],"measure,":[62],"compute":[63],"minimum":[65],"number":[66],"t":[67],"such":[68],"that":[69],"is":[71],"for":[77,120],"with":[79,90],"t\".":[81],"To":[82],"solve":[83],"problem,":[85],"present":[87],"three":[88],"algorithms":[89],"time":[91],"complexity":[92],"O(km(n":[93],"-":[94],"k)),":[95],"O(mn":[96,100],"2":[97,101],")":[98,102],"Hamming,":[104],"Levenshtein":[105],"edit":[107],"distance,":[108],"respectively.":[109],"A":[110],"World":[111],"Wide":[112],"Web":[113],"server":[114],"interface":[115],"been":[117],"established":[118],"at":[119],"automated":[121],"use":[122],"programs.":[125]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}