乐胖代购免代理版

{"id":"https://openalex.org/W1937857347","doi":"https://doi.org/10.1109/spire.1998.712980","title":"New approximation algorithms for longest common subsequences","display_name":"New approximation algorithms for longest common subsequences","publication_year":2002,"publication_date":"2002-11-27","ids":{"openalex":"https://openalex.org/W1937857347","doi":"https://doi.org/10.1109/spire.1998.712980","mag":"1937857347"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/spire.1998.712980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5078536084","display_name":"Lasse Bergroth","orcid":null},"institutions":[{"id":"https://openalex.org/I183173800","display_name":"Turku Centre for Computer Science","ror":"https://ror.org/00vy7ed73","country_code":"FI","type":"facility","lineage":["https://openalex.org/I130217899","https://openalex.org/I155660961","https://openalex.org/I183173800"]},{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"funder","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"L. Bergroth","raw_affiliation_strings":["Department of Computer Science and Turku Centre for Computer Science, University of Turku, Turku, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Turku Centre for Computer Science, University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I183173800","https://openalex.org/I155660961"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013089741","display_name":"Harri Hakonen","orcid":null},"institutions":[{"id":"https://openalex.org/I183173800","display_name":"Turku Centre for Computer Science","ror":"https://ror.org/00vy7ed73","country_code":"FI","type":"facility","lineage":["https://openalex.org/I130217899","https://openalex.org/I155660961","https://openalex.org/I183173800"]},{"id":"https://openalex.org/I155660961","display_name":"University of Turku","ror":"https://ror.org/05vghhr25","country_code":"FI","type":"funder","lineage":["https://openalex.org/I155660961"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"H. Hakonen","raw_affiliation_strings":["Department of Computer Science and Turku Centre for Computer Science, University of Turku, Turku, Finland","Turun Yliopisto, Turku, FI"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Turku Centre for Computer Science, University of Turku, Turku, Finland","institution_ids":["https://openalex.org/I183173800","https://openalex.org/I155660961"]},{"raw_affiliation_string":"Turun Yliopisto, Turku, FI","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046060531","display_name":"T. aRaita","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. aRaita","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.079,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":10,"citation_normalized_percentile":{"value":0.818175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":79,"max":80},"biblio":{"volume":"13","issue":null,"first_page":"32","last_page":"40"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9999,"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.9999,"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/T11106","display_name":"Data Management and Algorithms","score":0.9933,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12016","display_name":"Web Data Mining and Analysis","score":0.986,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/heuristics","display_name":"Heuristics","score":0.81579626},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.6744685},{"id":"https://openalex.org/keywords/complement","display_name":"Complement","score":0.5824978},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.41047978}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9195679},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.81579626},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.6744685},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.65628684},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5824978},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.57416904},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.52154565},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4950084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4491293},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44008407},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.42627543},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.41047978},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39917287},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.3839417},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3743137},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35106856},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20795655},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/spire.1998.712980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":16,"referenced_works":["https://openalex.org/W10539125","https://openalex.org/W1529615245","https://openalex.org/W1602643665","https://openalex.org/W1606584921","https://openalex.org/W1969214222","https://openalex.org/W1988684690","https://openalex.org/W1998241318","https://openalex.org/W2010260400","https://openalex.org/W2011632873","https://openalex.org/W2015292449","https://openalex.org/W2038268267","https://openalex.org/W2055043387","https://openalex.org/W2071184135","https://openalex.org/W2611071497","https://openalex.org/W2993945890","https://openalex.org/W4236236547"],"related_works":["https://openalex.org/W4389489786","https://openalex.org/W4323338832","https://openalex.org/W4289596129","https://openalex.org/W4225868058","https://openalex.org/W3022573534","https://openalex.org/W2969919693","https://openalex.org/W1974063126","https://openalex.org/W1746697883","https://openalex.org/W170643605","https://openalex.org/W1540010783"],"abstract_inverted_index":{"This":[0],"paper":[1],"focuses":[2],"on":[3],"finding":[4],"approximations":[5],"for":[6,21,36,69,77],"the":[7,22,37,44,62,70,104,117,120,132,146,149],"longest":[8],"common":[9],"subsequence":[10],"(lcs)":[11],"of":[12,43,47,61,107,134,148],"two":[13],"strings.":[14],"Most":[15],"methods":[16],"which":[17],"calculate":[18],"an":[19,108],"approximation":[20],"more":[23,87],"general":[24],"problem":[25],"accepting":[26],"N":[27],"(N/spl":[28],"ges/3)":[29],"input":[30],"strings,":[31],"give":[32,65],"typically":[33],"trivial":[34],"results":[35],"restricted":[38],"case":[39],"under":[40],"study.":[41],"Because":[42],"small":[45],"number":[46],"reliable":[48],"existing":[49],"heuristics,":[50],"we":[51],"introduce":[52],"several":[53],"new":[54],"ones":[55],"in":[56,157],"this":[57],"survey.":[58],"The":[59,113],"majority":[60],"presented":[63],"algorithms":[64],"a":[66,80,86,125,129,135,152],"lower":[67,96,136],"bound":[68,97],"lcs.":[71],"Thus":[72],"they":[73,123],"can":[74,98],"be":[75,100],"used,":[76],"example,":[78],"as":[79],"filter":[81],"to":[82,102,127,144],"decide":[83],"quickly,":[84],"if":[85],"detailed,":[88],"space-":[89],"and":[90,151],"time-consuming":[91],"study":[92],"is":[93,160],"needed.":[94],"A":[95],"also":[99],"used":[101],"limit":[103],"search":[105],"space":[106],"exact":[109],"lcs":[110],"method":[111],"effectively.":[112],"upper":[114],"bounds":[115],"complement":[116],"information":[118],"about":[119,131,154],"true":[121],"lcs;":[122],"form":[124],"basis":[126],"make":[128],"judgement":[130],"reliability":[133],"bound.":[137],"Extensive":[138],"tests":[139],"have":[140],"been":[141],"carried":[142],"out":[143],"show":[145],"strengths":[147],"heuristics":[150],"discussion":[153],"their":[155],"role":[156],"various":[158],"environments":[159],"given.":[161]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1937857347","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-03-21T18:55:59.423173","created_date":"2016-06-24"}