{"id":"https://openalex.org/W1521188358","doi":"https://doi.org/10.1007/11751649_2","title":"A CGM Algorithm Solving the Longest Increasing Subsequence Problem","display_name":"A CGM Algorithm Solving the Longest Increasing Subsequence Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1521188358","doi":"https://doi.org/10.1007/11751649_2","mag":"1521188358"},"language":"en","primary_location":{"id":"doi:10.1007/11751649_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11751649_2","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/A5112811055","display_name":"David Sem\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"David Sem\u00e9","raw_affiliation_strings":["LaRIA: Laboratoire de Recherche en Informatique d\u2019Amiens, Universit\u00e9 de Picardie Jules Verne, CURI, 5 rue du Moulin Neuf, 80000, Amiens, France","LaRIA: Laboratoire de Recherche en Informatique d'Amiens, Universit\u00e9 de Picardie Jules Verne, CURI, 5 rue du Moulin Neuf, 80000, Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LaRIA: Laboratoire de Recherche en Informatique d\u2019Amiens, Universit\u00e9 de Picardie Jules Verne, CURI, 5 rue du Moulin Neuf, 80000, Amiens, France","institution_ids":["https://openalex.org/I4647051"]},{"raw_affiliation_string":"LaRIA: Laboratoire de Recherche en Informatique d'Amiens, Universit\u00e9 de Picardie Jules Verne, CURI, 5 rue du Moulin Neuf, 80000, Amiens, France","institution_ids":["https://openalex.org/I4210144804","https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112811055"],"corresponding_institution_ids":["https://openalex.org/I4210144804","https://openalex.org/I4647051"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.04557327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"10","last_page":"21"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9994999766349792,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"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-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.8525766134262085},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.7817975878715515},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.7388453483581543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6103538870811462},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6015084981918335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5874862670898438},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5568740367889404},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5044659376144409},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.43893808126449585},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40843600034713745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33625975251197815}],"concepts":[{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.8525766134262085},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7817975878715515},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.7388453483581543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6103538870811462},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6015084981918335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5874862670898438},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5568740367889404},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5044659376144409},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.43893808126449585},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40843600034713745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33625975251197815},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11751649_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11751649_2","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W20034245","https://openalex.org/W938539187","https://openalex.org/W1487872891","https://openalex.org/W1553499933","https://openalex.org/W1562115776","https://openalex.org/W1599305879","https://openalex.org/W1818228354","https://openalex.org/W1966989285","https://openalex.org/W1979933052","https://openalex.org/W1981982305","https://openalex.org/W1986842525","https://openalex.org/W1990061958","https://openalex.org/W1992982349","https://openalex.org/W2006656002","https://openalex.org/W2010213237","https://openalex.org/W2045271686","https://openalex.org/W2066885472","https://openalex.org/W2069893028","https://openalex.org/W2083304901","https://openalex.org/W2102061396","https://openalex.org/W2121653690","https://openalex.org/W2137594903","https://openalex.org/W2144663105","https://openalex.org/W2147543351","https://openalex.org/W2159109004","https://openalex.org/W2275689183","https://openalex.org/W4251441228","https://openalex.org/W4251681643","https://openalex.org/W4255199623"],"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/W2152064395","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W3094761360"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}