{"id":"https://openalex.org/W7131879218","doi":"https://doi.org/10.48550/arxiv.2602.22551","title":"Identifying Multi-Hit Cancer Drivers Without Massive Parallelization: A CP, MIP, and Column Generation Framework","display_name":"Identifying Multi-Hit Cancer Drivers Without Massive Parallelization: A CP, MIP, and Column Generation Framework","publication_year":2026,"publication_date":"2026-02-26","ids":{"openalex":"https://openalex.org/W7131879218","doi":"https://doi.org/10.48550/arxiv.2602.22551"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.22551","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005804982","display_name":"R. Willemsen","orcid":"https://orcid.org/0000-0002-7275-4923"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Willemsen, Rick S. H.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000634517","display_name":"Tenindra Abeywickrama","orcid":"https://orcid.org/0000-0003-1053-2193"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abeywickrama, Tenindra","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031644457","display_name":"Ramu Anandakrishnan","orcid":"https://orcid.org/0000-0003-0422-3984"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anandakrishnan, Ramu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.20020000636577606,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.20020000636577606,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.16410000622272491,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.13339999318122864,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6373000144958496},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6080999970436096},{"id":"https://openalex.org/keywords/column","display_name":"Column (typography)","score":0.5817000269889832},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5633999705314636},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.5376999974250793},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.43720000982284546},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.3962000012397766},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.3939000070095062}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6373000144958496},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6080999970436096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6025999784469604},{"id":"https://openalex.org/C2780551164","wikidata":"https://www.wikidata.org/wiki/Q2306599","display_name":"Column (typography)","level":3,"score":0.5817000269889832},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5633999705314636},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5376999974250793},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.43720000982284546},{"id":"https://openalex.org/C70721500","wikidata":"https://www.wikidata.org/wiki/Q177005","display_name":"Computational biology","level":1,"score":0.40790000557899475},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3962000012397766},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.3939000070095062},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.38100001215934753},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3488999903202057},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.34220001101493835},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C189206191","wikidata":"https://www.wikidata.org/wiki/Q222046","display_name":"Genomics","level":4,"score":0.33149999380111694},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.328900009393692},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.32260000705718994},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3041999936103821},{"id":"https://openalex.org/C121608353","wikidata":"https://www.wikidata.org/wiki/Q12078","display_name":"Cancer","level":2,"score":0.30070000886917114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27559998631477356},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.26969999074935913},{"id":"https://openalex.org/C555283112","wikidata":"https://www.wikidata.org/wiki/Q1637543","display_name":"Carcinogenesis","level":3,"score":0.258899986743927},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2578999996185303}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.22551","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.22551","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.22551","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.22551","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.6303958296775818}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Cancer":[0,45],"is":[1,29,156],"often":[2],"driven":[3],"by":[4,118],"specific":[5],"combinations":[6,22,56],"of":[7,23,54,134,142,172],"an":[8,165],"estimated":[9],"two":[10],"to":[11,57,123],"nine":[12],"gene":[13,24,55],"mutations,":[14],"known":[15],"as":[16,42],"multi-hit":[17,21,175],"combinations.":[18],"Identifying":[19],"these":[20],"mutations":[25],"that":[26,149,168],"drive":[27],"cancer":[28,93],"critical":[30],"for":[31,131],"understanding":[32],"carcinogenesis":[33],"and":[34,74,85],"designing":[35],"targeted":[36],"therapies.":[37],"We":[38,111],"formalize":[39],"this":[40],"challenge":[41],"the":[43,52,120,126,135,140,154,170],"Multi-Hit":[44],"Driver":[46],"Set":[47],"Cover":[48],"Problem":[49],"(MHCDSCP),":[50],"optimizing":[51],"selection":[53],"maximize":[58],"tumor":[59],"coverage":[60],"while":[61],"strictly":[62],"minimizing":[63],"normal":[64],"sample":[65],"misclassification.":[66],"While":[67],"existing":[68],"approaches":[69],"rely":[70],"on":[71,82,91,150],"exhaustive":[72],"enumeration":[73],"massive":[75],"parallelization,":[76],"we":[77],"introduce":[78],"fast":[79,144],"heuristics":[80],"based":[81],"constraint":[83],"programming":[84,88],"mixed":[86],"integer":[87],"formulations.":[89],"Evaluated":[90],"real-world":[92,151],"genomics":[94],"data,":[95],"our":[96,143],"framework":[97],"matches":[98],"state-of-the-art":[99],"supercomputing":[100],"methods":[101],"using":[102],"a":[103,109,114],"single":[104],"commodity":[105],"CPU":[106],"in":[107],"under":[108],"minute.":[110],"also":[112],"propose":[113],"price-and-branch":[115],"heuristic":[116],"which,":[117],"solving":[119],"root":[121],"node":[122],"optimality,":[124],"provides":[125],"first":[127],"provably":[128],"optimal":[129],"solutions":[130],"over":[132],"half":[133],"benchmark":[136],"instances,":[137,153],"thereby":[138],"verifying":[139],"near-optimality":[141],"heuristics.":[145],"These":[146],"findings":[147],"demonstrate":[148],"problem":[152],"MHCDSCP":[155],"far":[157],"less":[158],"computationally":[159],"demanding":[160],"than":[161],"previously":[162,173],"believed,":[163],"providing":[164],"accessible":[166],"baseline":[167],"enables":[169],"exploration":[171],"intractable":[174],"modeling":[176],"assumptions.":[177]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-02-28T00:00:00"}