{"id":"https://openalex.org/W1823536187","doi":"https://doi.org/10.1007/11940128_41","title":"Algorithms for Computing Variants of the Longest Common Subsequence Problem","display_name":"Algorithms for Computing Variants of the Longest Common Subsequence Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1823536187","doi":"https://doi.org/10.1007/11940128_41","mag":"1823536187"},"language":"en","primary_location":{"id":"doi:10.1007/11940128_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11940128_41","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":"book-chapter","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/A5029174615","display_name":"M. Sohel Rahman","orcid":"https://orcid.org/0000-0001-9419-6478"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M. Sohel Rahman","raw_affiliation_strings":["Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London, WC2R 2LS, England","Algorithm Design Group, Department of Computer Science, King's College London, Strand, London, WC2R 2LS, England"],"affiliations":[{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London, WC2R 2LS, England","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King's College London, Strand, London, WC2R 2LS, England","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107931257","display_name":"Costas S. Iliopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Costas S. Iliopoulos","raw_affiliation_strings":["Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London, WC2R 2LS, England","Algorithm Design Group, Department of Computer Science, King's College London, Strand, London, WC2R 2LS, England"],"affiliations":[{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King\u2019s College London, Strand, London, WC2R 2LS, England","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Algorithm Design Group, Department of Computer Science, King's College London, Strand, London, WC2R 2LS, England","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029174615"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.7198,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.91140344,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"399","last_page":"408"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9846000075340271,"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"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9817000031471252,"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.9486669898033142},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.757026195526123},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7250717878341675},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6020204424858093},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5316658020019531},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4900189936161041},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.45943209528923035},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4484378397464752},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36757972836494446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18217262625694275},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.11979666352272034},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.11757117509841919}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9486669898033142},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.757026195526123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7250717878341675},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6020204424858093},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5316658020019531},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4900189936161041},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.45943209528923035},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4484378397464752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36757972836494446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18217262625694275},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.11979666352272034},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.11757117509841919},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11940128_41","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11940128_41","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":31,"referenced_works":["https://openalex.org/W1534390927","https://openalex.org/W1600401233","https://openalex.org/W1647671624","https://openalex.org/W1756652108","https://openalex.org/W1961096930","https://openalex.org/W1967690823","https://openalex.org/W1970026646","https://openalex.org/W1979109797","https://openalex.org/W1990061958","https://openalex.org/W1999395788","https://openalex.org/W2008803097","https://openalex.org/W2010260400","https://openalex.org/W2012010763","https://openalex.org/W2015292449","https://openalex.org/W2027506564","https://openalex.org/W2040176884","https://openalex.org/W2041650430","https://openalex.org/W2055043387","https://openalex.org/W2067194564","https://openalex.org/W2073544604","https://openalex.org/W2088055539","https://openalex.org/W2109227373","https://openalex.org/W2126808788","https://openalex.org/W2130200371","https://openalex.org/W2137120608","https://openalex.org/W2145838433","https://openalex.org/W2152506638","https://openalex.org/W2162744351","https://openalex.org/W2285602234","https://openalex.org/W2295860335","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W4225868058","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}