{"id":"https://openalex.org/W7138848887","doi":"https://doi.org/10.48550/arxiv.2603.16721","title":"Looking for (Genomic) Needles in a Haystack: Sparsity-Driven Search for Identifying Correlated Genetic Mutations in Cancer","display_name":"Looking for (Genomic) Needles in a Haystack: Sparsity-Driven Search for Identifying Correlated Genetic Mutations in Cancer","publication_year":2026,"publication_date":"2026-03-17","ids":{"openalex":"https://openalex.org/W7138848887","doi":"https://doi.org/10.48550/arxiv.2603.16721"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.16721","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16721","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"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":"https://doi.org/10.48550/arxiv.2603.16721","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5104344607","display_name":"Ritvik Prabhu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prabhu, Ritvik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129841289","display_name":"Emil Vatai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vatai, Emil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062060985","display_name":"Bernard Moussad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Moussad, Bernard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005797486","display_name":"Emmanuel Jeannot","orcid":"https://orcid.org/0000-0002-3956-2997"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jeannot, Emmanuel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","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":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129798671","display_name":"Wu-chun Feng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Feng, Wu-chun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130081109","display_name":"Mohamed Wahib","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wahib, Mohamed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":7,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.3952000141143799,"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.3952000141143799,"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/T11287","display_name":"Cancer Genomics and Diagnostics","score":0.10490000247955322,"subfield":{"id":"https://openalex.org/subfields/1306","display_name":"Cancer Research"},"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/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.08049999922513962,"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/pruning","display_name":"Pruning","score":0.6937999725341797},{"id":"https://openalex.org/keywords/discriminative-model","display_name":"Discriminative model","score":0.6406000256538391},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5687999725341797},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5490999817848206},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.47690001130104065},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.45239999890327454},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.41499999165534973},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.3612000048160553},{"id":"https://openalex.org/keywords/gene","display_name":"Gene","score":0.34389999508857727},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.3368000090122223}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6937999725341797},{"id":"https://openalex.org/C97931131","wikidata":"https://www.wikidata.org/wiki/Q5282087","display_name":"Discriminative model","level":2,"score":0.6406000256538391},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5687999725341797},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5490999817848206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5085999965667725},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.47690001130104065},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.45239999890327454},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.41499999165534973},{"id":"https://openalex.org/C70721500","wikidata":"https://www.wikidata.org/wiki/Q177005","display_name":"Computational biology","level":1,"score":0.36250001192092896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36149999499320984},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.3612000048160553},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.33559998869895935},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.334199994802475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3310000002384186},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.32989999651908875},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.329800009727478},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C141231307","wikidata":"https://www.wikidata.org/wiki/Q7020","display_name":"Genome","level":3,"score":0.3222000002861023},{"id":"https://openalex.org/C197077220","wikidata":"https://www.wikidata.org/wiki/Q720988","display_name":"Human genome","level":4,"score":0.3199999928474426},{"id":"https://openalex.org/C193524817","wikidata":"https://www.wikidata.org/wiki/Q386780","display_name":"Association rule learning","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C134765980","wikidata":"https://www.wikidata.org/wiki/Q879126","display_name":"Bitwise operation","level":2,"score":0.3095000088214874},{"id":"https://openalex.org/C69991583","wikidata":"https://www.wikidata.org/wiki/Q1423575","display_name":"Candidate gene","level":3,"score":0.29600000381469727},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29280000925064087},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.28299999237060547},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.27459999918937683},{"id":"https://openalex.org/C151810110","wikidata":"https://www.wikidata.org/wiki/Q7307074","display_name":"RefSeq","level":4,"score":0.2745000123977661},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.26010000705718994},{"id":"https://openalex.org/C189206191","wikidata":"https://www.wikidata.org/wiki/Q222046","display_name":"Genomics","level":4,"score":0.2540000081062317},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.16721","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16721","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.16721","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.16721","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.48606228828430176}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Cancer":[0],"typically":[1],"arises":[2],"not":[3],"from":[4,12],"a":[5,103,131,142,164,188],"single":[6],"genetic":[7],"mutation":[8,84],"(i.e.,":[9],"hit)":[10],"but":[11],"multi-hit":[13,21],"combinations":[14,22,35,120,183],"that":[15,77,106],"accumulate":[16],"within":[17],"cells.":[18],"However,":[19],"enumerating":[20],"becomes":[23],"exponentially":[24],"more":[25],"expensive":[26],"computationally":[27],"as":[28],"the":[29,39,48,53,59,79,91,112,151,192],"number":[30,49,60],"of":[31,41,50,61,90,99],"candidate":[32,119],"hit":[33],"gene":[34,138,216],"grow,":[36],"i.e.":[37],"on":[38,168,201],"order":[40],"20,000":[42,46],"choose":[43],"h,":[44],"where":[45],"is":[47,58,128,197],"genes":[51],"in":[52,82,130,181],"human":[54],"genome":[55],"and":[56,149,163,186,213,221],"h":[57],"hits.":[62],"To":[63],"address":[64],"this":[65,100],"challenge,":[66],"we":[67],"present":[68],"an":[69],"algorithmic":[70],"framework,":[71],"called":[72],"Pruned":[73],"Depth-First":[74],"Search":[75],"(P-DFS)":[76],"leverages":[78],"high":[80],"sparsity":[81,108],"tumor":[83],"data":[85],"to":[86,109],"prune":[87],"large":[88],"portions":[89],"search":[92,116,133],"space.":[93],"Specifically,":[94],"P-DFS":[95],"(the":[96],"main":[97],"contribution":[98],"paper)":[101],"-":[102,126,178],"pruning":[104],"technique":[105],"exploits":[107],"drastically":[110],"reduce":[111],"otherwise":[113],"exponential":[114],"h-hit":[115],"space":[117],"for":[118,184],"used":[121],"by":[122],"Weighted":[123],"Set":[124],"Cover":[125],"which":[127],"grounded":[129],"depth-first":[132],"backtracking":[134],"technique,":[135],"prunes":[136],"infeasible":[137],"subsets":[139],"early,":[140],"while":[141],"weighted":[143],"set":[144,194],"cover":[145,195],"formulation":[146],"systematically":[147],"scores":[148],"selects":[150],"most":[152],"discriminative":[153],"combinations.":[154],"By":[155],"intertwining":[156],"these":[157],"ideas":[158],"with":[159],"optimized":[160],"bitwise":[161],"operations":[162],"scalable":[165],"distributed":[166],"algorithm":[167,173],"high-performance":[169],"computing":[170],"clusters,":[171],"our":[172,207],"can":[174,209],"achieve":[175],"approximately":[176],"90":[177],"98%":[179],"reduction":[180],"visited":[182],"4-hits,":[185],"roughly":[187],"183x":[189],"speedup":[190],"over":[191],"exhaustive":[193],"approach(which":[196],"algorithmically":[198],"NP-complete)":[199],"measured":[200],"147,456":[202],"ranks.":[203],"In":[204],"doing":[205],"so,":[206],"method":[208],"feasibly":[210],"handle":[211],"four-hit":[212],"even":[214],"higher-order":[215],"hits,":[217],"achieving":[218],"both":[219],"speed":[220],"resource":[222],"efficiency.":[223]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-20T00:00:00"}