{"id":"https://openalex.org/W2159782909","doi":"https://doi.org/10.1007/s00453-008-9175-1","title":"On the Longest Common Rigid Subsequence Problem","display_name":"On the Longest Common Rigid Subsequence Problem","publication_year":2008,"publication_date":"2008-03-03","ids":{"openalex":"https://openalex.org/W2159782909","doi":"https://doi.org/10.1007/s00453-008-9175-1","mag":"2159782909"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-008-9175-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9175-1","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY, 10598, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY, 10598, USA","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012404981","display_name":"Moshe Lewenstein","orcid":"https://orcid.org/0000-0002-8272-244X"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moshe Lewenstein","raw_affiliation_strings":["Department of Computer Science, Bar Ilan University, Ramat Gan, 52900, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Bar Ilan University, Ramat Gan, 52900, Israel","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100749735","display_name":"Bin Ma","orcid":"https://orcid.org/0000-0002-9223-9654"},"institutions":[{"id":"https://openalex.org/I125749732","display_name":"Western University","ror":"https://ror.org/02grkyz14","country_code":"CA","type":"education","lineage":["https://openalex.org/I125749732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Bin Ma","raw_affiliation_strings":["Department of Computer Science, University of Western Ontario, London, ON, N6A 5B7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Western Ontario, London, ON, N6A 5B7, Canada","institution_ids":["https://openalex.org/I125749732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081729547","display_name":"Kaizhong Zhang","orcid":"https://orcid.org/0000-0003-1734-5921"},"institutions":[{"id":"https://openalex.org/I125749732","display_name":"Western University","ror":"https://ror.org/02grkyz14","country_code":"CA","type":"education","lineage":["https://openalex.org/I125749732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kaizhong Zhang","raw_affiliation_strings":["Department of Computer Science, University of Western Ontario, London, ON, N6A 5B7, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Western Ontario, London, ON, N6A 5B7, Canada","institution_ids":["https://openalex.org/I125749732"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I1341412227"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.1755,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85558677,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"56","issue":"2","first_page":"270","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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.9994999766349792,"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.9821000099182129,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.9815013408660889},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.8612053394317627},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7717673778533936},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.7237932085990906},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5845984220504761},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.5780799984931946},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5741331577301025},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.5628836154937744},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5219585299491882},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5048132538795471},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4889780282974243},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.4258868992328644},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39300617575645447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30237501859664917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2671129107475281},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.21985509991645813},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.06118115782737732}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9815013408660889},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8612053394317627},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7717673778533936},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.7237932085990906},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5845984220504761},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.5780799984931946},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5741331577301025},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.5628836154937744},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5219585299491882},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5048132538795471},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4889780282974243},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.4258868992328644},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39300617575645447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30237501859664917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2671129107475281},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.21985509991645813},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.06118115782737732},{"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-008-9175-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-008-9175-1","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/b4bc9686-a112-47fb-8470-78b8d4da59c3","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/b4bc9686-a112-47fb-8470-78b8d4da59c3","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Lewenstein, M, Ma, B & Zhang, K 2010, 'On the longest common rigid subsequence problem', Algorithmica, vol. 56, no. 2, pp. 270-280. https://doi.org/10.1007/s00453-008-9175-1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:693879","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=693879","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0178-4617","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:693879","is_oa":false,"landing_page_url":"http://repository.tue.nl/693879","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0178-4617","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/b4bc9686-a112-47fb-8470-78b8d4da59c3","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/b4bc9686-a112-47fb-8470-78b8d4da59c3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 56(2), 270 - 280. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"display_name":"Zero hunger","id":"https://metadata.un.org/sdg/2"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320994","display_name":"Canada Research Chairs","ror":"https://ror.org/0517h6h17"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W133334320","https://openalex.org/W1491028479","https://openalex.org/W1531307672","https://openalex.org/W1964541472","https://openalex.org/W1973754133","https://openalex.org/W1975924111","https://openalex.org/W2010260400","https://openalex.org/W2012391569","https://openalex.org/W2017758253","https://openalex.org/W2025567828","https://openalex.org/W2028903194","https://openalex.org/W2038225707","https://openalex.org/W2040176884","https://openalex.org/W2047386086","https://openalex.org/W2053743126","https://openalex.org/W2055656009","https://openalex.org/W2061821311","https://openalex.org/W2068871408","https://openalex.org/W2085239230","https://openalex.org/W2145838433","https://openalex.org/W2151864878","https://openalex.org/W2496163386"],"related_works":["https://openalex.org/W4390923554","https://openalex.org/W2520870971","https://openalex.org/W4385963882","https://openalex.org/W2950594955","https://openalex.org/W2147602940","https://openalex.org/W4385904708","https://openalex.org/W1887778146","https://openalex.org/W2109822297","https://openalex.org/W3101942351","https://openalex.org/W2038918619"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}