{"id":"https://openalex.org/W206897732","doi":"https://doi.org/10.1007/978-3-642-31265-6_11","title":"Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths","display_name":"Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W206897732","doi":"https://doi.org/10.1007/978-3-642-31265-6_11","mag":"206897732"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-31265-6_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-31265-6_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5036752760","display_name":"Guillaume Blin","orcid":"https://orcid.org/0000-0002-0708-0838"},"institutions":[{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Guillaume Blin","raw_affiliation_strings":["LIGM, UMR 8049, Universit\u00e9 Paris-Est, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIGM, UMR 8049, Universit\u00e9 Paris-Est, France","institution_ids":["https://openalex.org/I4210152518"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017247640","display_name":"Laurent Bulteau","orcid":"https://orcid.org/0000-0003-1645-9345"},"institutions":[{"id":"https://openalex.org/I97188460","display_name":"Nantes Universit\u00e9","ror":"https://ror.org/03gnr7b55","country_code":"FR","type":"education","lineage":["https://openalex.org/I97188460"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Laurent Bulteau","raw_affiliation_strings":["LINA, UMR 6241, Universit\u00e9 de Nantes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LINA, UMR 6241, Universit\u00e9 de Nantes, France","institution_ids":["https://openalex.org/I97188460"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080563649","display_name":"Minghui Jiang","orcid":"https://orcid.org/0000-0003-1843-9292"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Minghui Jiang","raw_affiliation_strings":["Department of Computer Science, Utah State University, USA","Department of Computer Science, Utah State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utah State University, USA","institution_ids":["https://openalex.org/I121980950"]},{"raw_affiliation_string":"Department of Computer Science, Utah State University","institution_ids":["https://openalex.org/I121980950"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034666721","display_name":"Pedro J. Tejada","orcid":null},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pedro J. Tejada","raw_affiliation_strings":["Department of Computer Science, Utah State University, USA","Department of Computer Science, Utah State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utah State University, USA","institution_ids":["https://openalex.org/I121980950"]},{"raw_affiliation_string":"Department of Computer Science, Utah State University","institution_ids":["https://openalex.org/I121980950"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027495509","display_name":"St\u00e9phane Vialette","orcid":"https://orcid.org/0000-0003-2308-6970"},"institutions":[{"id":"https://openalex.org/I4210152518","display_name":"Laboratoire d'Informatique Gaspard-Monge","ror":"https://ror.org/04t50yk91","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I142631665","https://openalex.org/I4210145102","https://openalex.org/I4210152518","https://openalex.org/I4210154111","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"St\u00e9phane Vialette","raw_affiliation_strings":["LIGM, UMR 8049, Universit\u00e9 Paris-Est, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIGM, UMR 8049, Universit\u00e9 Paris-Est, France","institution_ids":["https://openalex.org/I4210152518"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"138","last_page":"148"},"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9958999752998352,"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/T12029","display_name":"DNA and Biological Computing","score":0.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.8098791837692261},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6552289128303528},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6459680795669556},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6256791353225708},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5836381912231445},{"id":"https://openalex.org/keywords/spelling","display_name":"Spelling","score":0.4531266689300537},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4530888795852661},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.4482835829257965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3509141206741333},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35054969787597656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3309674859046936}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.8098791837692261},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6552289128303528},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6459680795669556},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6256791353225708},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5836381912231445},{"id":"https://openalex.org/C2777801307","wikidata":"https://www.wikidata.org/wiki/Q2088390","display_name":"Spelling","level":2,"score":0.4531266689300537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4530888795852661},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.4482835829257965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3509141206741333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35054969787597656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3309674859046936},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-31265-6_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-31265-6_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-00683311v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00683311","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Jul 2012, Helsinki, Finland. pp.138-148, ⟨10.1007/978-3-642-31265-6_11⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8299999833106995,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W204059611","https://openalex.org/W303013107","https://openalex.org/W1504417041","https://openalex.org/W1535018767","https://openalex.org/W1600388734","https://openalex.org/W1968328322","https://openalex.org/W1999591020","https://openalex.org/W2000332055","https://openalex.org/W2007540612","https://openalex.org/W2010260400","https://openalex.org/W2037968786","https://openalex.org/W2040176884","https://openalex.org/W2042476538","https://openalex.org/W2049231620","https://openalex.org/W2053651631","https://openalex.org/W2056989509","https://openalex.org/W2060047347","https://openalex.org/W2071418719","https://openalex.org/W2090534409","https://openalex.org/W2109227373","https://openalex.org/W2111356103","https://openalex.org/W2115667895","https://openalex.org/W2127515417","https://openalex.org/W4254652536"],"related_works":["https://openalex.org/W1540010783","https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W4225868058","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W4323338832","https://openalex.org/W3094761360"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}