{"id":"https://openalex.org/W2091254169","doi":"https://doi.org/10.1016/s0166-218x(98)00065-1","title":"A 2 superstring approximation algorithm","display_name":"A 2 superstring approximation algorithm","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W2091254169","doi":"https://doi.org/10.1016/s0166-218x(98)00065-1","mag":"2091254169"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(98)00065-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(98)00065-1","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/s0166-218x(98)00065-1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043007480","display_name":"Chris Armen","orcid":null},"institutions":[{"id":"https://openalex.org/I162281398","display_name":"University of Hartford","ror":"https://ror.org/034gcgd08","country_code":"US","type":"education","lineage":["https://openalex.org/I162281398"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chris Armen","raw_affiliation_strings":["Department of Computer Science, University of Hartford, W. Hartford, CT 06117-1599, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hartford, W. Hartford, CT 06117-1599, USA","institution_ids":["https://openalex.org/I162281398"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054641291","display_name":"Clifford Stein","orcid":"https://orcid.org/0000-0002-0614-6620"},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Clifford Stein","raw_affiliation_strings":["Dartmouth College, Hanover, NH 03755-3510, USA"],"affiliations":[{"raw_affiliation_string":"Dartmouth College, Hanover, NH 03755-3510, USA","institution_ids":["https://openalex.org/I107672454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043007480"],"corresponding_institution_ids":["https://openalex.org/I162281398"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":{"value":2750,"currency":"USD","value_usd":2750},"fwci":0.0,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.1624418,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"88","issue":"1-3","first_page":"29","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9997000098228455,"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.9997000098228455,"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/T12029","display_name":"DNA and Biological Computing","score":0.9745000004768372,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9722999930381775,"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/substring","display_name":"Substring","score":0.9425273537635803},{"id":"https://openalex.org/keywords/superstring-theory","display_name":"Superstring theory","score":0.8818812966346741},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.652027428150177},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6043715476989746},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5991312861442566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5740876793861389},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.5334088802337646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5315563082695007},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4564800560474396},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.4293578863143921},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35127153992652893},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.24941223859786987},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.21587899327278137},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18847724795341492},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07939839363098145},{"id":"https://openalex.org/keywords/supersymmetry","display_name":"Supersymmetry","score":0.07711321115493774}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.9425273537635803},{"id":"https://openalex.org/C20288","wikidata":"https://www.wikidata.org/wiki/Q1437042","display_name":"Superstring theory","level":3,"score":0.8818812966346741},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.652027428150177},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6043715476989746},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5991312861442566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5740876793861389},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5334088802337646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5315563082695007},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4564800560474396},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.4293578863143921},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35127153992652893},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.24941223859786987},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.21587899327278137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18847724795341492},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07939839363098145},{"id":"https://openalex.org/C116674579","wikidata":"https://www.wikidata.org/wiki/Q193442","display_name":"Supersymmetry","level":2,"score":0.07711321115493774},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0166-218x(98)00065-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(98)00065-1","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.7007","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.7007","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.dartmouth.edu/~cliff/papers/Superstring223Journal.ps.Z","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s0166-218x(98)00065-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(98)00065-1","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W156230010","https://openalex.org/W610283090","https://openalex.org/W1488861257","https://openalex.org/W1501313444","https://openalex.org/W1529615245","https://openalex.org/W1544644664","https://openalex.org/W1547966682","https://openalex.org/W1984236772","https://openalex.org/W1989048084","https://openalex.org/W1997416868","https://openalex.org/W2011557376","https://openalex.org/W2035314514","https://openalex.org/W2035610952","https://openalex.org/W2036145579","https://openalex.org/W2037050365","https://openalex.org/W2053913299","https://openalex.org/W2063556310","https://openalex.org/W2069323107","https://openalex.org/W2080721852","https://openalex.org/W2101468281","https://openalex.org/W2102403605","https://openalex.org/W2122132398","https://openalex.org/W2134761228","https://openalex.org/W2413933131","https://openalex.org/W2752885492","https://openalex.org/W2917094338","https://openalex.org/W4239263507","https://openalex.org/W4241387086","https://openalex.org/W6606359487","https://openalex.org/W6629208127","https://openalex.org/W6632853796","https://openalex.org/W6659377750","https://openalex.org/W6675067564","https://openalex.org/W6675355612","https://openalex.org/W6678455942"],"related_works":["https://openalex.org/W2141006903","https://openalex.org/W2036145579","https://openalex.org/W1585123441","https://openalex.org/W2902482624","https://openalex.org/W52396946","https://openalex.org/W2298204719","https://openalex.org/W2376315482","https://openalex.org/W1564013439","https://openalex.org/W3112977702","https://openalex.org/W3022344494"],"abstract_inverted_index":{"Given":[0],"a":[1,14,20,26,38,57,101,141,180,221],"collection":[2],"of":[3,17,40,55,60,110,133,158,176,225],"strings":[4,177,202,218],"ifS":[5],"=":[6],"s1,":[7],"\u2026,":[8],"sn":[9],"over":[10],"an":[11,111,155],"alphabet":[12],"\u2211,":[13],"superstring":[15,50,58,65,102],"\u03b1":[16,36,59],"S":[18],"is":[19,52],"string":[21],"containing":[22],"each":[23,31],"si,":[24],"as":[25],"substring;":[27],"that":[28,44,127,178,219],"is,":[29],"for":[30,193],"i,":[32],"1\u2a7d":[33],"i":[34],"\u2a7dn,":[35],"contains":[37],"block":[39],"\u00a6si\u00a6":[41],"consecutive":[42],"characters":[43],"match":[45],"si":[46],"exactly.":[47],"The":[48,63,88],"shortest":[49,64],"problem":[51,54,66],"the":[53,108,116,130,135,164,190,226],"finding":[56],"minimum":[61],"length.":[62],"has":[67],"applications":[68],"in":[69,94,119,166,171,189],"both":[70],"data":[71],"compression":[72],"and":[73,144,168,184,203,229],"computational":[74],"biology.":[75],"It":[76],"was":[77,137],"shown":[78],"by":[79],"Blum":[80,95],"et":[81,96],"al.":[82,97],"(1994)":[83],"to":[84,115,199,217,234],"be":[85,187],"MAX":[86],"SNP-hard.":[87],"first":[89],"O(1)-approximation":[90],"algorithm":[91,117,139],"also":[92],"appeared":[93],"(1994),":[98],"which":[99,153,172,185],"returns":[100],"no":[103],"more":[104,222],"than":[105],"3":[106],"times":[107],"length":[109],"optimal":[112],"solution.":[113],"Prior":[114],"described":[118],"this":[120,211,215,232],"paper,":[121],"there":[122],"were":[123],"several":[124],"published":[125],"results":[126],"improved":[128,237],"on":[129,163],"approximation":[131,156],"ratio;":[132],"these,":[134],"best":[136],"our":[138,149,194,236],"ShortString,":[140],"234-approximation":[142],"Armen":[143,167],"Stein":[145,169],"(1995).":[146],"We":[147,196],"present":[148,188],"new":[150],"algorithm,":[151],"G-ShortString,":[152],"achieves":[154],"ratio":[157],"223.":[159],"Our":[160],"approach":[161],"builds":[162],"work":[165],"(1995)":[170],"we":[173,213,230],"identified":[174],"classes":[175],"have":[179],"nested":[181],"periodic":[182],"structure,":[183,228],"must":[186],"worst":[191],"case":[192],"algorithms.":[195],"introduced":[197],"machinery":[198],"describe":[200],"these":[201],"proved":[204],"strong":[205],"structural":[206],"properties":[207],"about":[208],"them.":[209],"In":[210],"paper":[212],"extend":[214],"study":[216],"exhibit":[220],"relaxed":[223],"form":[224],"same":[227],"use":[231],"understanding":[233],"obtain":[235],"result.":[238]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}