{"id":"https://openalex.org/W2999744948","doi":"https://doi.org/10.1007/978-3-030-38919-2_43","title":"The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps","display_name":"The Maximum Equality-Free String Factorization Problem: Gaps vs. No Gaps","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2999744948","doi":"https://doi.org/10.1007/978-3-030-38919-2_43","mag":"2999744948"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-38919-2_43","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-38919-2_43","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":true,"oa_status":"gold","oa_url":"https://ibn.idsi.md/vizualizare_articol/134334","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005721226","display_name":"Radu Stefan Mincu","orcid":"https://orcid.org/0000-0003-2613-582X"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Radu Stefan Mincu","raw_affiliation_strings":["Department of Computer Science, University of Bucharest, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008143115","display_name":"Alexandru Popa","orcid":"https://orcid.org/0000-0003-3364-1210"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]},{"id":"https://openalex.org/I4210114681","display_name":"National Institute for Research & Development in Informatics","ror":"https://ror.org/028rq5v79","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210114681"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Alexandru Popa","raw_affiliation_strings":["Department of Computer Science, University of Bucharest, Bucharest, Romania","National Institute for Research and Development in Informatics, Bucharest, Romania"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I141595442"]},{"raw_affiliation_string":"National Institute for Research and Development in Informatics, Bucharest, Romania","institution_ids":["https://openalex.org/I4210114681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005721226"],"corresponding_institution_ids":["https://openalex.org/I141595442"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01659708,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"531","last_page":"543"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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.9995999932289124,"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.9957000017166138,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.729984700679779},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.6140970587730408},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6090390086174011},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6014687418937683},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.521136999130249},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49164873361587524},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4832068681716919},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47741401195526123},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4633517563343048},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.46071773767471313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42868179082870483},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42181581258773804},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23613828420639038},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21997126936912537},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11816507577896118},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.09779670834541321}],"concepts":[{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.729984700679779},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.6140970587730408},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6090390086174011},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6014687418937683},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.521136999130249},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49164873361587524},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4832068681716919},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47741401195526123},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4633517563343048},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.46071773767471313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42868179082870483},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42181581258773804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23613828420639038},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21997126936912537},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11816507577896118},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.09779670834541321},{"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/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"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":2,"locations":[{"id":"doi:10.1007/978-3-030-38919-2_43","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-38919-2_43","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"},{"id":"pmh:oai:ibn.idsi.md:134334","is_oa":true,"landing_page_url":"https://ibn.idsi.md/vizualizare_articol/134334","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematics and Information Technologies: Research and Education","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:ibn.idsi.md:134334","is_oa":true,"landing_page_url":"https://ibn.idsi.md/vizualizare_articol/134334","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematics and Information Technologies: Research and Education","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.550000011920929,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1553958932","https://openalex.org/W1990180428","https://openalex.org/W2122962290","https://openalex.org/W2238855891","https://openalex.org/W2244603524","https://openalex.org/W2253902058","https://openalex.org/W2913904462"],"related_works":["https://openalex.org/W2075485134","https://openalex.org/W1597445688","https://openalex.org/W1977957904","https://openalex.org/W1750715882","https://openalex.org/W2004490284","https://openalex.org/W2990814010","https://openalex.org/W2407583267","https://openalex.org/W2788624646","https://openalex.org/W2150793317","https://openalex.org/W2475015781"],"abstract_inverted_index":{"A":[0],"factorization":[1,45,63,105,127],"of":[2,9,74,88,113,136,153,168,204,214],"a":[3,7,22,51,86,130,165,211,226],"string":[4,53],"w":[5,10,54,59],"is":[6,24,47,95,138],"partition":[8,23],"into":[11],"substrings":[12],"$$u_1,\\dots":[13],",u_k$$":[14],"such":[15],"that":[16,93,123,240],"$$w=u_1":[17],"u_2":[18],"\\cdots":[19],"u_k$$.":[20],"Such":[21],"called":[25],"equality-free":[26,44,62,104,126],"if":[27,100],"no":[28],"two":[29],"factors":[30,137,222],"are":[31,219],"equal:":[32],"$$u_i":[33],"\\ne":[34,40],"u_j,":[35],"\\forall":[36],"i,j$$":[37],"with":[38,64,106,129],"$$i":[39],"j$$.":[41],"The":[42],"maximum":[43,125],"problem":[46,90,128,216,243],"to":[48,98,173,200],"decide,":[49],"for":[50,231],"given":[52,178],"and":[55,91,195,223],"integer":[56],"k,":[57],"whether":[58],"admits":[60],"an":[61,103,107,191],"k":[65],"factors.":[66,115],"Equality-free":[67],"factorizations":[68,163],"have":[69],"lately":[70],"received":[71],"attention":[72],"because":[73],"their":[75],"application":[76],"in":[77],"DNA":[78],"self-assembly.":[79],"Condon":[80],"et":[81,120],"al.":[82,121],"(CPM":[83],"2012)":[84],"study":[85,210],"version":[87,213],"the":[89,111,114,124,134,149,154,202,215,241,245,249],"show":[92,122],"it":[94],"$$\\mathcal":[96,139],"{NP}$$-complete":[97],"decide":[99],"there":[101],"exists":[102],"upper":[108],"bound":[109,132],"on":[110,133,177],"length":[112],"At":[116],"STACS":[117],"2015,":[118],"Fernau":[119],"lower":[131],"number":[135],"{NP}$$-complete.":[140],"Shortly":[141],"after,":[142],"Schmid":[143],"(CiE":[144],"2015)":[145],"presents":[146],"results":[147],"concerning":[148],"Fixed":[150],"Parameter":[151],"Tractability":[152],"problems.":[155],"In":[156],"this":[157,181,232],"paper":[158],"we":[159,171,183,196,209,224,238],"approach":[160],"equality":[161],"free":[162],"from":[164],"practical":[166],"point":[167],"view":[169],"i.e.":[170],"wish":[172],"obtain":[174],"good":[175],"solutions":[176],"instances.":[179],"To":[180],"end,":[182],"provide":[184],"approximation":[185,229],"algorithms,":[186],"heuristics,":[187],"Integer":[188],"Programming":[189],"models,":[190],"improved":[192],"FPT":[193],"algorithm":[194,230],"also":[197],"conduct":[198],"experiments":[199,237],"analyze":[201],"performance":[203],"our":[205],"proposed":[206],"algorithms.":[207],"Additionally,":[208],"relaxed":[212,242],"where":[217],"gaps":[218],"allowed":[220],"between":[221],"design":[225],"constant":[227],"factor":[228],"case.":[233],"Surprisingly,":[234],"after":[235],"extensive":[236],"conjecture":[239],"has":[244],"same":[246],"optimum":[247],"as":[248],"original.":[250]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}