{"id":"https://openalex.org/W7118957298","doi":"https://doi.org/10.1137/1.9781611978957.16","title":"New Heuristic and Multivalued Decision Diagram-based Exact Algorithms for Repetition-Free Longest Common Subsequence Problems","display_name":"New Heuristic and Multivalued Decision Diagram-based Exact Algorithms for Repetition-Free Longest Common Subsequence Problems","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118957298","doi":"https://doi.org/10.1137/1.9781611978957.16"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978957.16","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978957.16","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 Proceedings of the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX)","raw_type":"book-chapter"},"type":"book-chapter","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/A5015542807","display_name":"S\u00e1ndor P. Fekete","orcid":"https://orcid.org/0000-0002-9062-4241"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["AT","DE"],"is_corresponding":true,"raw_author_name":"S\u00e1ndor P. Fekete","raw_affiliation_strings":["TU Braunschweig, Algorithms Group"],"affiliations":[{"raw_affiliation_string":"TU Braunschweig, Algorithms Group","institution_ids":["https://openalex.org/I4210099593","https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076288432","display_name":"Phillip Keldenich","orcid":"https://orcid.org/0000-0002-6677-5090"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["AT","DE"],"is_corresponding":false,"raw_author_name":"Phillip Keldenich","raw_affiliation_strings":["TU Braunschweig, Algorithms Group"],"affiliations":[{"raw_affiliation_string":"TU Braunschweig, Algorithms Group","institution_ids":["https://openalex.org/I4210099593","https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073066645","display_name":"Dominik Krupke","orcid":"https://orcid.org/0000-0003-1573-3496"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["AT","DE"],"is_corresponding":false,"raw_author_name":"Dominik Krupke","raw_affiliation_strings":["TU Braunschweig, Algorithms Group"],"affiliations":[{"raw_affiliation_string":"TU Braunschweig, Algorithms Group","institution_ids":["https://openalex.org/I4210099593","https://openalex.org/I94509681"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021280030","display_name":"Michael Perk","orcid":"https://orcid.org/0000-0002-0141-8594"},"institutions":[{"id":"https://openalex.org/I4210099593","display_name":"Computer Algorithms for Medicine","ror":"https://ror.org/00zky6d38","country_code":"AT","type":"facility","lineage":["https://openalex.org/I4210099593"]},{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["AT","DE"],"is_corresponding":false,"raw_author_name":"Michael Perk","raw_affiliation_strings":["TU Braunschweig, Algorithms Group"],"affiliations":[{"raw_affiliation_string":"TU Braunschweig, Algorithms Group","institution_ids":["https://openalex.org/I4210099593","https://openalex.org/I94509681"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015542807"],"corresponding_institution_ids":["https://openalex.org/I4210099593","https://openalex.org/I94509681"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32478632,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"221"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.24130000174045563,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.24130000174045563,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.10819999873638153,"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/T10142","display_name":"Formal Methods in Verification","score":0.0949999988079071,"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/class","display_name":"Class (philosophy)","score":0.6244000196456909},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5676000118255615},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.5529000163078308},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5389000177383423},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5181000232696533},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.47699999809265137},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.44440001249313354},{"id":"https://openalex.org/keywords/propositional-formula","display_name":"Propositional formula","score":0.39480000734329224},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.37540000677108765}],"concepts":[{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6244000196456909},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5676000118255615},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.5529000163078308},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5389000177383423},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5181000232696533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5164999961853027},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.47699999809265137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46619999408721924},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45879998803138733},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4456999897956848},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.44440001249313354},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.39480000734329224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3880000114440918},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.3727000057697296},{"id":"https://openalex.org/C136726353","wikidata":"https://www.wikidata.org/wiki/Q903789","display_name":"Disjunctive normal form","level":2,"score":0.34689998626708984},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.3402000069618225},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.311599999666214},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.30979999899864197},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2994000017642975},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C33054407","wikidata":"https://www.wikidata.org/wiki/Q6504747","display_name":"Software verification","level":5,"score":0.27390000224113464},{"id":"https://openalex.org/C149091818","wikidata":"https://www.wikidata.org/wiki/Q2429814","display_name":"Software system","level":3,"score":0.2612999975681305},{"id":"https://openalex.org/C2984968299","wikidata":"https://www.wikidata.org/wiki/Q1077784","display_name":"Software tool","level":3,"score":0.2563999891281128},{"id":"https://openalex.org/C529173508","wikidata":"https://www.wikidata.org/wiki/Q638608","display_name":"Software development","level":3,"score":0.25529998540878296},{"id":"https://openalex.org/C101814296","wikidata":"https://www.wikidata.org/wiki/Q5439685","display_name":"Feature model","level":3,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978957.16","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978957.16","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 Proceedings of the SIAM Symposium on Algorithm Engineering and Experiments (ALENEX)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"a":[2,28,40,45,55,65],"class":[3],"of":[4,44,54,68,74],"optimization":[5],"problems":[6],"that":[7,71],"are":[8,26,50],"fundamental":[9],"to":[10,39,63,83],"testing":[11],"in":[12,18,34,86],"modern":[13],"configurable":[14],"software":[15,46],"systems,":[16],"e.g.,":[17],"automotive":[19],"industries.":[20],"In":[21],"pairwise":[22],"interaction":[23],"sampling,":[24],"we":[25],"given":[27,56],"(potentially":[29],"very":[30],"large)":[31],"configuration":[32],"space,":[33],"which":[35],"each":[36,72],"dimension":[37],"corresponds":[38],"possible":[41],"Boolean":[42],"feature":[43],"system;":[47],"valid":[48],"configurations":[49],"the":[51],"satisfying":[52],"assignments":[53],"propositional":[57],"formula":[58],"\\(\\unicode{x03C6}\\).":[59],"The":[60],"objective":[61],"is":[62,76],"find":[64],"minimum-sized":[66],"family":[67],"configurations,":[69],"such":[70],"pair":[73],"features":[75],"jointly":[77],"tested":[78],"at":[79],"least":[80],"once.":[81],"Due":[82],"its":[84],"relevance":[85],"Software":[87],"Engineering,":[88],"this":[89],"problem":[90],"has":[91],"been":[92],"studied":[93],"extensively":[94],"for":[95],"over":[96],"20":[97],"years.":[98]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}