{"id":"https://openalex.org/W1810245723","doi":"https://doi.org/10.1007/bfb0029797","title":"On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings","display_name":"On the worst-case behaviour of some approximation algorithms for the shortest common supersequence of k strings","publication_year":2005,"publication_date":"2005-12-01","ids":{"openalex":"https://openalex.org/W1810245723","doi":"https://doi.org/10.1007/bfb0029797","mag":"1810245723"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0029797","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0029797","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/A5030437633","display_name":"Robert W. Irving","orcid":null},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Robert W. Irving","raw_affiliation_strings":["Computing Science Department, University of Glasgow, G12 8QQ, Glasgow, Scotland","University of Glasgow"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Science Department, University of Glasgow, G12 8QQ, Glasgow, Scotland","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"University of Glasgow","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023294162","display_name":"Campbell Fraser","orcid":"https://orcid.org/0009-0005-2035-4409"},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Campbell B. Fraser","raw_affiliation_strings":["Computing Science Department, University of Glasgow, G12 8QQ, Glasgow, Scotland","University of Glasgow"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computing Science Department, University of Glasgow, G12 8QQ, Glasgow, Scotland","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"University of Glasgow","institution_ids":["https://openalex.org/I7882870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I7882870"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"63","last_page":"73"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9944999814033508,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9926000237464905,"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/alphabet","display_name":"Alphabet","score":0.6811019778251648},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5847716331481934},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5655933022499084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5577883720397949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5405612587928772},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5229364633560181},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.512579619884491},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.507724404335022},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.504055380821228},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.4935685396194458},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3871661424636841},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28784292936325073},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05879417061805725}],"concepts":[{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6811019778251648},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5847716331481934},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5655933022499084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5577883720397949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5405612587928772},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5229364633560181},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.512579619884491},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.507724404335022},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.504055380821228},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.4935685396194458},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3871661424636841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28784292936325073},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05879417061805725},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bfb0029797","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0029797","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":18,"referenced_works":["https://openalex.org/W1754581094","https://openalex.org/W1903636486","https://openalex.org/W1970026646","https://openalex.org/W1982819660","https://openalex.org/W1992904575","https://openalex.org/W2003021193","https://openalex.org/W2011632873","https://openalex.org/W2022467404","https://openalex.org/W2022835995","https://openalex.org/W2027506564","https://openalex.org/W2038225707","https://openalex.org/W2040176884","https://openalex.org/W2041650430","https://openalex.org/W2071184135","https://openalex.org/W2130200371","https://openalex.org/W2143391442","https://openalex.org/W2162744351","https://openalex.org/W6642850889"],"related_works":["https://openalex.org/W1979381633","https://openalex.org/W1826355535","https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2962917430","https://openalex.org/W2045237525","https://openalex.org/W2028468530","https://openalex.org/W189401716","https://openalex.org/W2898570308"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}