{"id":"https://openalex.org/W4281567003","doi":"https://doi.org/10.1186/s13015-022-00217-9","title":"Heuristic shortest hyperpaths in cell signaling hypergraphs","display_name":"Heuristic shortest hyperpaths in cell signaling hypergraphs","publication_year":2022,"publication_date":"2022-05-26","ids":{"openalex":"https://openalex.org/W4281567003","doi":"https://doi.org/10.1186/s13015-022-00217-9","pmid":"https://pubmed.ncbi.nlm.nih.gov/35619179"},"language":"en","primary_location":{"id":"doi:10.1186/s13015-022-00217-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-022-00217-9","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/s13015-022-00217-9","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/s13015-022-00217-9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004770693","display_name":"Spencer Krieger","orcid":"https://orcid.org/0000-0002-2822-022X"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Spencer Krieger","raw_affiliation_strings":["Department of Computer Science, The University of Arizona, Tucson, Arizona, 85721, USA. spencer.krieger@gmail.com","Department of Computer Science, The University of Arizona, Tucson, Arizona, 85721, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Arizona, Tucson, Arizona, 85721, USA. spencer.krieger@gmail.com","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Department of Computer Science, The University of Arizona, Tucson, Arizona, 85721, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083998316","display_name":"John Kececioglu","orcid":"https://orcid.org/0000-0003-1204-6535"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Kececioglu","raw_affiliation_strings":["Department of Computer Science, The University of Arizona, Tucson, Arizona, 85721, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Arizona, Tucson, Arizona, 85721, USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1490,"currency":"GBP","value_usd":1827},"apc_paid":{"value":1490,"currency":"GBP","value_usd":1827},"fwci":0.8662,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.70787104,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"17","issue":"1","first_page":"12","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.4390000104904175,"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"}},"topics":[{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.4390000104904175,"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"}},{"id":"https://openalex.org/T10621","display_name":"Gene Regulatory Network Analysis","score":0.2605000138282776,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.03099999949336052,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/heuristic","display_name":"Heuristic","score":0.710017204284668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5927918553352356},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5160674452781677},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4793860912322998},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4529135227203369},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43256402015686035},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42201608419418335},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4185156524181366},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3957566022872925},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3330274820327759},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32227951288223267},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2685776948928833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10408946871757507}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.710017204284668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5927918553352356},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5160674452781677},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4793860912322998},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4529135227203369},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43256402015686035},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42201608419418335},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4185156524181366},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3957566022872925},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3330274820327759},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32227951288223267},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2685776948928833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10408946871757507},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1186/s13015-022-00217-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-022-00217-9","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/s13015-022-00217-9","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},{"id":"pmid:35619179","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/35619179","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for molecular biology : AMB","raw_type":null},{"id":"pmh:oai:doaj.org/article:34b641c45b9d4e149d6c7cbe9a62d132","is_oa":false,"landing_page_url":"https://doaj.org/article/34b641c45b9d4e149d6c7cbe9a62d132","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms for Molecular Biology, Vol 17, Iss 1, Pp 1-26 (2022)","raw_type":"article"},{"id":"pmh:oai:pubmedcentral.nih.gov:9134692","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/9134692","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms Mol Biol","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1186/s13015-022-00217-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-022-00217-9","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/s13015-022-00217-9","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G178049114","display_name":null,"funder_award_id":"CCF-1617192","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4579036255","display_name":"EAGER: Breaking the Speed and Accuracy Barrier for Protein Property Prediction","funder_award_id":"2041613","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337351","display_name":"National Cancer Institute","ror":"https://ror.org/040gcmg81"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4281567003.pdf","grobid_xml":"https://content.openalex.org/works/W4281567003.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1969709265","https://openalex.org/W1976720680","https://openalex.org/W1984249061","https://openalex.org/W1984759958","https://openalex.org/W1986365650","https://openalex.org/W1989191256","https://openalex.org/W1993363599","https://openalex.org/W2000317249","https://openalex.org/W2001221312","https://openalex.org/W2009405916","https://openalex.org/W2023208820","https://openalex.org/W2046440184","https://openalex.org/W2050017155","https://openalex.org/W2050625863","https://openalex.org/W2083220586","https://openalex.org/W2083786039","https://openalex.org/W2096766502","https://openalex.org/W2106576681","https://openalex.org/W2112660220","https://openalex.org/W2124096367","https://openalex.org/W2137875903","https://openalex.org/W2147714160","https://openalex.org/W2162708312","https://openalex.org/W2163898101","https://openalex.org/W2171991455","https://openalex.org/W2299844414","https://openalex.org/W2522250770","https://openalex.org/W2524699965","https://openalex.org/W2802305337","https://openalex.org/W2971279876","https://openalex.org/W2981727906","https://openalex.org/W4239403073","https://openalex.org/W4245562979","https://openalex.org/W4246219036","https://openalex.org/W4281567003"],"related_works":["https://openalex.org/W2072730699","https://openalex.org/W2017597147","https://openalex.org/W1889072701","https://openalex.org/W1982719520","https://openalex.org/W1509031531","https://openalex.org/W2000969332","https://openalex.org/W2314620773","https://openalex.org/W2006709159","https://openalex.org/W4214682109","https://openalex.org/W13236304"],"abstract_inverted_index":{"BACKGROUND:":[0],"Cell":[1],"signaling":[2,76,255],"pathways,":[3],"which":[4,65,170,204,244],"are":[5,19,190],"a":[6,46,58,62,79,106,139,174,265],"series":[7,52],"of":[8,43,53,133,150,186],"reactions":[9,27,54],"that":[10,88,112,176,189],"start":[11],"at":[12,16,287],"receptors":[13],"and":[14,94,116,136,166,237,277],"end":[15],"transcription":[17],"factors,":[18],"basic":[20],"to":[21,56,83,91,119],"systems":[22],"biology.":[23],"Properly":[24],"modeling":[25],"the":[26,49,103,124,131,151,163,178,199,202,218,222,261],"in":[28,61,74,225,245,264],"such":[29,210],"pathways":[30],"requires":[31],"directed":[32,39,63],"hypergraphs,":[33,135],"where":[34,194],"an":[35,85],"edge":[36],"is":[37,66,89,117,153,234,281],"now":[38,250],"between":[40],"two":[41],"sets":[42],"vertices.":[44],"Inferring":[45],"pathway":[47,168],"by":[48,221],"most":[50],"parsimonious":[51],"corresponds":[55],"finding":[57,241],"shortest":[59,72,110,231],"hyperpath":[60,87,175,232,262,275],"hypergraph,":[64],"NP-complete.":[67],"The":[68,148,229],"current":[69],"state-of-the-art":[70,179],"for":[71,102,108,130,142,252,260,274,284],"hyperpaths":[73,111,129,197,216],"cell":[75,254],"hypergraphs":[77],"solves":[78],"mixed-integer":[80,180],"linear":[81,181],"program":[82,182],"find":[84],"optimal":[86,128],"restricted":[90],"be":[92,120],"acyclic,":[93],"offers":[95],"no":[96,206],"efficiency":[97],"guarantees.":[98],"RESULTS:":[99],"We":[100,122],"present,":[101],"first":[104],"time,":[105],"heuristic":[107,125,152,200,223,233,263],"general":[109,246],"properly":[113],"handles":[114],"cycles,":[115,249],"guaranteed":[118],"efficient.":[121],"show":[123,171],"finds":[126,173,205],"provably":[127],"class":[132],"singleton-tail":[134],"also":[137],"give":[138],"practical":[140,251],"algorithm":[141],"tractably":[143],"generating":[144],"all":[145,159,187,214,278],"source-sink":[146,160,215,242],"hyperpaths.":[147],"accuracy":[149],"demonstrated":[154],"through":[155],"comprehensive":[156],"experiments":[157],"on":[158,183,208],"instances":[161,188,193],"from":[162],"standard":[164],"NCI-PID":[165],"Reactome":[167],"databases,":[169],"it":[172],"matches":[177],"over":[184],"99%":[185],"acyclic.":[191],"On":[192],"only":[195],"cyclic":[196,211],"exist,":[198],"surpasses":[201],"state-of-the-art,":[203],"solution;":[207],"every":[209],"instance,":[212],"enumerating":[213],"shows":[217],"solution":[219],"found":[220],"was":[224],"fact":[226],"optimal.":[227],"CONCLUSIONS:":[228],"new":[230,266],"both":[235],"fast":[236],"accurate.":[238],"This":[239],"makes":[240],"hyperpaths,":[243],"may":[247],"contain":[248],"real":[253],"networks.":[256],"AVAILABILITY:":[257],"Source":[258],"code":[259],"tool":[267],"we":[268],"call":[269],"Hhugin":[270],"(as":[271],"well":[272],"as":[273],"enumeration,":[276],"dataset":[279],"instances)":[280],"available":[282],"free":[283],"non-commercial":[285],"use":[286],"http://hhugin.cs.arizona.edu.":[288]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}