{"id":"https://openalex.org/W2115667895","doi":"https://doi.org/10.1016/0304-3975(94)00251-d","title":"The parameterized complexity of sequence alignment and consensus","display_name":"The parameterized complexity of sequence alignment and consensus","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W2115667895","doi":"https://doi.org/10.1016/0304-3975(94)00251-d","mag":"2115667895"},"language":"en","primary_location":{"id":"doi:10.1016/0304-3975(94)00251-d","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00251-d","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Computer Science Department, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, Netherlands","Computer Science Department, Utrecht University, TB Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Computer Science Department, Utrecht University, TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071503687","display_name":"Rodney G. Downey","orcid":"https://orcid.org/0000-0003-4381-2845"},"institutions":[{"id":"https://openalex.org/I41156924","display_name":"Victoria University of Wellington","ror":"https://ror.org/0040r6f76","country_code":"NZ","type":"education","lineage":["https://openalex.org/I41156924"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Rodney G. Downey","raw_affiliation_strings":["Mathematics Department, Victoria University, P.O. Box 600, Wellington, New Zealand","Mathematics Department, Victoria University, Wellington, New Zealand ("],"affiliations":[{"raw_affiliation_string":"Mathematics Department, Victoria University, P.O. Box 600, Wellington, New Zealand","institution_ids":["https://openalex.org/I41156924"]},{"raw_affiliation_string":"Mathematics Department, Victoria University, Wellington, New Zealand (","institution_ids":["https://openalex.org/I41156924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michael R. Fellows","raw_affiliation_strings":["Computer Science Department, University of Victoria, Victoria British Columbia V8W 3P6, Canada","[Computer Science Department, University of Victoria, Victoria, Canada]"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Victoria, Victoria British Columbia V8W 3P6, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"[Computer Science Department, University of Victoria, Victoria, Canada]","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022101310","display_name":"H. Todd Wareham","orcid":null},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Harold T. Wareham","raw_affiliation_strings":["Computer Science Department, University of Victoria, Victoria British Columbia V8W 3P6, Canada","[Computer Science Department, University of Victoria, Victoria, Canada]"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Victoria, Victoria British Columbia V8W 3P6, Canada","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"[Computer Science Department, University of Victoria, Victoria, Canada]","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022101310"],"corresponding_institution_ids":["https://openalex.org/I212119943"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":5.2825,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.955285,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"147","issue":"1-2","first_page":"31","last_page":"54"},"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9991000294685364,"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.9965000152587891,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9651986360549927},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.9010846614837646},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.8464069366455078},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.6723237037658691},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6531070470809937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6492387652397156},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6432737112045288},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5178037881851196},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4637067914009094},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.433560311794281},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4256821870803833},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3262290954589844}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9651986360549927},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.9010846614837646},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.8464069366455078},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.6723237037658691},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6531070470809937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6492387652397156},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6432737112045288},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5178037881851196},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4637067914009094},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.433560311794281},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4256821870803833},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3262290954589844},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0304-3975(94)00251-d","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0304-3975(94)00251-d","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W139921209","https://openalex.org/W601138394","https://openalex.org/W1497155250","https://openalex.org/W1501400124","https://openalex.org/W1508604143","https://openalex.org/W1565519167","https://openalex.org/W1587619488","https://openalex.org/W1754581094","https://openalex.org/W1966291420","https://openalex.org/W1987663950","https://openalex.org/W1995872006","https://openalex.org/W2005485907","https://openalex.org/W2013490745","https://openalex.org/W2040176884","https://openalex.org/W2044966609","https://openalex.org/W2080959872","https://openalex.org/W2084297478","https://openalex.org/W2095145214","https://openalex.org/W2914364168","https://openalex.org/W4255011371","https://openalex.org/W6605658434","https://openalex.org/W6618276983","https://openalex.org/W6629805644","https://openalex.org/W6633876855","https://openalex.org/W6637792530","https://openalex.org/W6651964849"],"related_works":["https://openalex.org/W4225868058","https://openalex.org/W3022573534","https://openalex.org/W2152064395","https://openalex.org/W4289596129","https://openalex.org/W1540010783","https://openalex.org/W3083981518","https://openalex.org/W2515730273","https://openalex.org/W3094761360","https://openalex.org/W25732909","https://openalex.org/W2890007239"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}