{"id":"https://openalex.org/W1481901482","doi":"https://doi.org/10.1007/11682462_20","title":"An Algorithm for a Generalized Maximum Subsequence Problem","display_name":"An Algorithm for a Generalized Maximum Subsequence Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1481901482","doi":"https://doi.org/10.1007/11682462_20","mag":"1481901482"},"language":"en","primary_location":{"id":"doi:10.1007/11682462_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11682462_20","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/A5003618837","display_name":"Thorsten Bernholt","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thorsten Bernholt","raw_affiliation_strings":["Informatik 2, Universit\u00e4t Dortmund, 44221, Dortmund, Germany","Informatik 5, Universit\u00e4t Dortmund, 44221, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Informatik 2, Universit\u00e4t Dortmund, 44221, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Informatik 5, Universit\u00e4t Dortmund, 44221, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109240751","display_name":"Thomas Hofmeister","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Hofmeister","raw_affiliation_strings":["Informatik 2, Universit\u00e4t Dortmund, 44221, Dortmund, Germany","Informatik 5, Universit\u00e4t Dortmund, 44221, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Informatik 2, Universit\u00e4t Dortmund, 44221, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]},{"raw_affiliation_string":"Informatik 5, Universit\u00e4t Dortmund, 44221, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.1755,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.92304394,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"178","last_page":"189"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9965999722480774,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9902999997138977,"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/subsequence","display_name":"Subsequence","score":0.859707236289978},{"id":"https://openalex.org/keywords/quasiconvex-function","display_name":"Quasiconvex function","score":0.8027365207672119},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.6444231271743774},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6304469704627991},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5802366137504578},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5297718048095703},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5267053246498108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5152902603149414},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49820804595947266},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.4359613358974457},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4115087389945984},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40957915782928467},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.12978804111480713},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.08369839191436768},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.06604823470115662}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.859707236289978},{"id":"https://openalex.org/C80278974","wikidata":"https://www.wikidata.org/wiki/Q1126412","display_name":"Quasiconvex function","level":5,"score":0.8027365207672119},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.6444231271743774},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6304469704627991},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5802366137504578},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5297718048095703},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5267053246498108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5152902603149414},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49820804595947266},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.4359613358974457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4115087389945984},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40957915782928467},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.12978804111480713},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.08369839191436768},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.06604823470115662},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11682462_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11682462_20","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W180909918","https://openalex.org/W1593563200","https://openalex.org/W1594402927","https://openalex.org/W1966321968","https://openalex.org/W2073008938","https://openalex.org/W2114510609","https://openalex.org/W2125962775","https://openalex.org/W2149906774","https://openalex.org/W2162894628","https://openalex.org/W2238365835","https://openalex.org/W2296319761","https://openalex.org/W2336485197","https://openalex.org/W4242246215","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W1974063126","https://openalex.org/W2969919693","https://openalex.org/W4225868058","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}