{"id":"https://openalex.org/W1982157147","doi":"https://doi.org/10.1142/s0129054105003777","title":"CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM","display_name":"CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W1982157147","doi":"https://doi.org/10.1142/s0129054105003777","mag":"1982157147"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054105003777","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003777","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046770604","display_name":"Uli Laube","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Uli Laube","raw_affiliation_strings":["Institute of Computer Science,  Johann Wolfgang Goethe-Universit\u00e4t, Robert Mayer Str. 11-15,  Frankfurt am Main, 60054, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science,  Johann Wolfgang Goethe-Universit\u00e4t, Robert Mayer Str. 11-15,  Frankfurt am Main, 60054, Germany","institution_ids":["https://openalex.org/I114090438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068747971","display_name":"Maik Weinard","orcid":null},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maik Weinard","raw_affiliation_strings":["Institute of Computer Science,  Johann Wolfgang Goethe-Universit\u00e4t, Robert Mayer Str. 11-15,  Frankfurt am Main, 60054, Germany"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science,  Johann Wolfgang Goethe-Universit\u00e4t, Robert Mayer Str. 11-15,  Frankfurt am Main, 60054, Germany","institution_ids":["https://openalex.org/I114090438"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046770604"],"corresponding_institution_ids":["https://openalex.org/I114090438"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.09414866,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"06","first_page":"1219","last_page":"1230"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.7429313063621521},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7114019393920898},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6867152452468872},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5877113342285156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5707991123199463},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5091809630393982},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49121421575546265},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.41993945837020874},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4096144139766693},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3737579584121704},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3490199148654938},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0767771303653717}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7429313063621521},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7114019393920898},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6867152452468872},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5877113342285156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5707991123199463},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5091809630393982},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49121421575546265},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.41993945837020874},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4096144139766693},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3737579584121704},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3490199148654938},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0767771303653717},{"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.1142/s0129054105003777","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054105003777","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1547966682","https://openalex.org/W1573175443","https://openalex.org/W1833520238","https://openalex.org/W2016871709","https://openalex.org/W2037050365","https://openalex.org/W2080721852","https://openalex.org/W2134761228","https://openalex.org/W2143391442","https://openalex.org/W2148352980","https://openalex.org/W4252621211"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W1827895227","https://openalex.org/W2011675579","https://openalex.org/W4285104409","https://openalex.org/W4210317843"],"abstract_inverted_index":{"We":[0,106,122],"investigate":[1],"the":[2,29,37,56,69,90,112,126,142,145,149],"shortest":[3],"common":[4],"superstring":[5],"problem":[6],"(SCSSP).":[7],"As":[8],"SCSSP":[9,74],"is":[10,25,28,34,43,53,61,93,137],"APX-complete":[11],"it":[12],"cannot":[13],"be":[14,120,159],"approximated":[15],"within":[16],"an":[17,78,85],"arbitrarily":[18],"small":[19],"performance":[20,38,59],"ratio.":[21],"One":[22],"heuristic":[23,42],"that":[24,36,55,125],"widely":[26],"used":[27,160],"notorious":[30],"greedy":[31,57,66,91,146],"heuristic.":[32],"It":[33,52],"known,":[35],"ratio":[39,60],"of":[40,81,89,99],"this":[41,116,165],"at":[44],"least":[45],"2":[46,64],"and":[47,132],"not":[48],"worse":[49],"than":[50],"4.":[51],"conjectured":[54],"heuristic's":[58],"in":[62,101,130,148],"fact":[63],"(the":[65],"conjecture).":[67],"Even":[68],"best":[70],"algorithms":[71],"introduced":[72,129],"for":[73,95,114,134,144],"can":[75,119,158],"only":[76],"guarantee":[77],"upper":[79],"bound":[80],"2.5.":[82],"In":[83],"[11]":[84,131],"even":[86],"stronger":[87,117],"version":[88,118],"conjecture":[92,147],"proven":[94],"a":[96],"restricted":[97],"class":[98,113],"orders":[100],"which":[102,115],"strings":[103],"are":[104],"merged.":[105],"extend":[107],"these":[108],"results":[109],"by":[110],"broadening":[111],"established.":[121],"also":[123],"show":[124],"Triple":[127],"inequality,":[128],"crucial":[133],"their":[135],"results,":[136],"inherently":[138],"insufficient":[139],"to":[140,161],"carry":[141],"proof":[143],"general":[150],"case.":[151],"Finally":[152],"we":[153],"describe":[154],"how":[155],"linear":[156],"programming":[157],"support":[162],"research":[163],"along":[164],"line.":[166]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}