{"id":"https://openalex.org/W2238790049","doi":"https://doi.org/10.5281/zenodo.1083622","title":"Approximation Algorithm For The Shortest Approximate Common Superstring Problem","display_name":"Approximation Algorithm For The Shortest Approximate Common Superstring Problem","alternate_titles":[],"publication_year":2007,"publication_date":"2007-12-21","ids":{"openalex":"https://openalex.org/W2238790049","doi":"https://doi.org/10.5281/zenodo.1083622","mag":"2238790049"},"language":"en","primary_location":{"id":"pmh:oai:zenodo.org:1083623","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/1083623","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"parent_works":[],"lineage":["https://openalex.org/W2238790049"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1083623","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"A.S. Reba\u00ef","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"A.S. Reba\u00ef","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5106408403","display_name":"Mourad Elloumi","orcid":"https://orcid.org/0000-0003-0570-4309","observed_orcids":["https://orcid.org/0000-0003-0570-4309"]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"M. Elloumi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5083,"has_fulltext":false,"cited_by_count":2,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.60824742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":"12","first_page":"609","last_page":"614"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.989300012588501,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.008799999952316284,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.0006000000284984708,"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/approximation-algorithms","display_name":"approximation algorithms","score":0.6729999780654907},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.7310000061988831},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.8420000076293945},{"id":"https://openalex.org/keywords/string-compression","display_name":"string compression","score":0.5479999780654907}],"concepts":[{"id":"https://openalex.org/C20288","wikidata":"https://www.wikidata.org/wiki/Q1437042","display_name":"Superstring theory","level":3,"score":0.7194274663925171},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5134326219558716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4213409125804901},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3476993441581726},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33401453495025635},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0663413405418396},{"id":"https://openalex.org/C116674579","wikidata":"https://www.wikidata.org/wiki/Q193442","display_name":"Supersymmetry","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:zenodo.org:1083623","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/1083623","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.5281/zenodo.1083622","doi":"https://doi.org/10.5281/zenodo.1083622","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.1083622","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},{"id":"doi:10.5281/zenodo.1083623","doi":"https://doi.org/10.5281/zenodo.1083623","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.1083623","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"},{"id":"mag:2238790049","doi":null,"is_oa":false,"landing_page_url":"https://publications.waset.org/14792/approximation-algorithm-for-the-shortest-approximate-common-superstring-problem","pdf_url":null,"source":{"id":"https://openalex.org/S2764557504","display_name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.3421","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.3421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.waset.org/ijcsse/v3/v3-3-26.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1083623","doi":null,"is_oa":true,"landing_page_url":"https://zenodo.org/record/1083623","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1544644664","https://openalex.org/W1968190141","https://openalex.org/W1970026646","https://openalex.org/W1975975525","https://openalex.org/W1984236772","https://openalex.org/W1990413869","https://openalex.org/W1999668682","https://openalex.org/W2002148379","https://openalex.org/W2003476672","https://openalex.org/W2036145579","https://openalex.org/W2040176884","https://openalex.org/W2062533874","https://openalex.org/W2085379600","https://openalex.org/W2090223576","https://openalex.org/W2166612500","https://openalex.org/W2341171179"],"related_works":["https://openalex.org/W7096814175","https://openalex.org/W2080721852","https://openalex.org/W4390579133","https://openalex.org/W2272324648","https://openalex.org/W1506017505","https://openalex.org/W1555279366","https://openalex.org/W1509809476","https://openalex.org/W7206150774","https://openalex.org/W4402586393"],"abstract_inverted_index":{"The":[0],"Shortest":[1],"Approximate":[2,115],"Common":[3],"Superstring":[4],"(SACS)":[5],"problem":[6,57],"is":[7,22,42,72,80,89,97,106],":":[8],"Given":[9],"a":[10,32,65,73,101],"set":[11],"of":[12,26,40,46,51,81,92,100,110,113],"strings":[13,53,94],"f={w1,":[14],"w2,":[15],"...":[16],",":[17],"wn},":[18],"where":[19,87],"no":[20],"wi":[21],"an":[23,43],"approximate":[24,44],"substring":[25,45],"wj,":[27],"i":[28],"\u2260":[29],"j,":[30],"find":[31],"shortest":[33],"string":[34,39],"Sa,":[35],"such":[36],"that,":[37],"every":[38],"f":[41],"Sa.":[47],"When":[48],"the":[49,52,55,76,90,93,98,111,114],"number":[50,91],"n>2,":[54],"SACS":[56,68,77,104],"becomes":[58],"NP-complete.":[59],"In":[60],"this":[61],"paper,":[62],"we":[63],"present":[64],"greedy":[66],"approximation":[67],"algorithm.":[69],"Our":[70,103],"algorithm":[71,105],"1/2-approximation":[74],"for":[75],"problem.":[78],"It":[79],"complexity":[82],"O(n2*(l2+log(n)))":[83],"in":[84],"computing":[85],"time,":[86],"n":[88],"and":[95],"l":[96],"length":[99],"string.":[102],"based":[107],"on":[108],"computation":[109],"Length":[112],"Longest":[116],"Overlap":[117],"(LALO).":[118]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2238790049","counts_by_year":[],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
