{"id":"https://openalex.org/W1977957904","doi":"https://doi.org/10.1145/1103963.1103971","title":"The greedy algorithm for the minimum common string partition problem","display_name":"The greedy algorithm for the minimum common string partition problem","publication_year":2005,"publication_date":"2005-10-01","ids":{"openalex":"https://openalex.org/W1977957904","doi":"https://doi.org/10.1145/1103963.1103971","mag":"1977957904"},"language":"en","primary_location":{"id":"doi:10.1145/1103963.1103971","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1103963.1103971","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5024529572","display_name":"Marek Chrob\u00e1k","orcid":"https://orcid.org/0000-0002-8673-2709"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marek Chrobak","raw_affiliation_strings":["University of California, Riverside, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Riverside, CA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080963999","display_name":"Petr Kolman","orcid":"https://orcid.org/0000-0003-2235-0506"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Petr Kolman","raw_affiliation_strings":["Charles University, Czech Republic","Charles Univ., Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles Univ., Czech Republic#TAB#","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061997850","display_name":"Ji\u0159\u0131\u0301 Sgall","orcid":"https://orcid.org/0000-0003-3658-4848"},"institutions":[{"id":"https://openalex.org/I202391551","display_name":"Czech Academy of Sciences","ror":"https://ror.org/053avzc18","country_code":"CZ","type":"government","lineage":["https://openalex.org/I202391551"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u00ed Sgall","raw_affiliation_strings":["Academy of Sciences of the Czech Republic, Czech Republic","Academy of Sciences of the Czech Republic, Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Academy of Sciences of the Czech Republic, Czech Republic","institution_ids":["https://openalex.org/I202391551"]},{"raw_affiliation_string":"Academy of Sciences of the Czech Republic, Czech Republic#TAB#","institution_ids":["https://openalex.org/I202391551"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8559,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.84568341,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"1","issue":"2","first_page":"350","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9994999766349792,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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.9854999780654907,"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/substring","display_name":"Substring","score":0.9555155634880066},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7275631427764893},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.687739372253418},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.647112250328064},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6336894631385803},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5377792119979858},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.520453691482544},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49922800064086914},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4673099219799042},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3903837203979492},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36129212379455566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20966368913650513},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.1630907952785492}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.9555155634880066},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7275631427764893},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.687739372253418},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.647112250328064},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6336894631385803},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5377792119979858},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.520453691482544},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49922800064086914},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4673099219799042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3903837203979492},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36129212379455566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20966368913650513},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.1630907952785492},{"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":1,"locations":[{"id":"doi:10.1145/1103963.1103971","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1103963.1103971","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1534995305","https://openalex.org/W1597445688","https://openalex.org/W1647671624","https://openalex.org/W1821540522","https://openalex.org/W2030016852","https://openalex.org/W2054849588","https://openalex.org/W2057568625","https://openalex.org/W2061135126","https://openalex.org/W2076047621","https://openalex.org/W2088179629","https://openalex.org/W2099956347","https://openalex.org/W2142096960","https://openalex.org/W2151325537","https://openalex.org/W2765896480","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2060058676","https://openalex.org/W2044080796","https://openalex.org/W1998402272","https://openalex.org/W2095809912","https://openalex.org/W2356523329","https://openalex.org/W1750715882","https://openalex.org/W1977957904","https://openalex.org/W2507111105","https://openalex.org/W3013679163","https://openalex.org/W3007783271"],"abstract_inverted_index":{"In":[0,99],"the":[1,22,28,31,34,75,81,100,107],"Minimum":[2],"Common":[3],"String":[4],"Partition":[5],"problem":[6,37],"(MCSP),":[7],"we":[8,16,104,116],"are":[9],"given":[10,76],"two":[11],"strings":[12],"on":[13],"input,":[14],"and":[15,93],"wish":[17],"to":[18,112],"partition":[19],"them":[20],"into":[21],"same":[23],"collection":[24],"of":[25,30,84,102,121],"substrings,":[26],"minimizing":[27],"number":[29],"substrings":[32],"in":[33,54],"partition.":[35],"This":[36],"is":[38,87,110],"NP-hard,":[39],"even":[40],"for":[41,63],"a":[42,60,70,118],"special":[43],"case,":[44],"denoted":[45],"2-MCSP,":[46,103],"where":[47],"each":[48,55,67],"letter":[49],"occurs":[50],"at":[51,66],"most":[52],"twice":[53],"input":[56],"string.":[57],"We":[58,78],"study":[59],"greedy":[61],"algorithm":[62,86],"MCSP":[64],"that":[65,80,106],"step":[68],"extracts":[69],"longest":[71],"common":[72],"substring":[73],"from":[74],"strings.":[77],"show":[79,105],"approximation":[82,108],"ratio":[83,109],"this":[85],"between":[88],"\u03a9(":[89],"n":[90,96,123],"0.43":[91],")":[92],"O":[94],"(":[95],"0.69":[97],").":[98,124],"case":[101],"equal":[111],"3.":[113],"For":[114],"4-MCSP,":[115],"give":[117],"lower":[119],"bound":[120],"\u03a9(log":[122]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"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-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}