{"id":"https://openalex.org/W4415428290","doi":"https://doi.org/10.3233/faia251112","title":"Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly","display_name":"Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly","publication_year":2025,"publication_date":"2025-10-21","ids":{"openalex":"https://openalex.org/W4415428290","doi":"https://doi.org/10.3233/faia251112"},"language":null,"primary_location":{"id":"doi:10.3233/faia251112","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251112","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/faia251112","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071995361","display_name":"Mathieu Besan\u00e7on","orcid":"https://orcid.org/0000-0002-6284-3033"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210101348","display_name":"Centre Inria de l'Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/00n8d6z93","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210101348"]},{"id":"https://openalex.org/I4210104430","display_name":"Laboratoire d'Informatique de Grenoble","ror":"https://ror.org/01c8rcg82","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210104430","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]},{"id":"https://openalex.org/I899635006","display_name":"Universit\u00e9 Grenoble Alpes","ror":"https://ror.org/02rx3b187","country_code":"FR","type":"education","lineage":["https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mathieu Besan\u00e7on","raw_affiliation_strings":["Universit\u00e9 Grenoble Alpes, Inria, LIG, CNRS"],"raw_orcid":"https://orcid.org/0000-0002-6284-3033","affiliations":[{"raw_affiliation_string":"Universit\u00e9 Grenoble Alpes, Inria, LIG, CNRS","institution_ids":["https://openalex.org/I4210104430","https://openalex.org/I4210101348","https://openalex.org/I1294671590","https://openalex.org/I899635006"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071995361"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210101348","https://openalex.org/I4210104430","https://openalex.org/I899635006"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.65223026,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T10409","display_name":"Fuel Cells and Related Materials","score":0.9818000197410583,"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"}},{"id":"https://openalex.org/T11407","display_name":"Innovative Microfluidic and Catalytic Techniques Innovation","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/integer","display_name":"Integer (computer science)","score":0.4945000112056732},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.48840001225471497},{"id":"https://openalex.org/keywords/prior-probability","display_name":"Prior probability","score":0.4731999933719635},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.4408000111579895},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.40639999508857727},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4047999978065491},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.3808000087738037},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36880001425743103},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.366100013256073}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5813000202178955},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5109000205993652},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4945000112056732},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49380001425743103},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.48840001225471497},{"id":"https://openalex.org/C177769412","wikidata":"https://www.wikidata.org/wiki/Q278090","display_name":"Prior probability","level":3,"score":0.4731999933719635},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.4408000111579895},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.40639999508857727},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4047999978065491},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.3808000087738037},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.366100013256073},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.35100001096725464},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.349700003862381},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3456999957561493},{"id":"https://openalex.org/C116834253","wikidata":"https://www.wikidata.org/wiki/Q2039217","display_name":"Identification (biology)","level":2,"score":0.3287000060081482},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.31139999628067017},{"id":"https://openalex.org/C37423430","wikidata":"https://www.wikidata.org/wiki/Q6750281","display_name":"Hull","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30570000410079956},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.2660999894142151}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/faia251112","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251112","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.3233/faia251112","is_oa":true,"landing_page_url":"https://doi.org/10.3233/faia251112","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Decomposing":[0],"a":[1,4,10,14,58,92,126,140],"flow":[2,102,110],"on":[3,96,108,160],"Directed":[5],"Acyclic":[6],"Graph":[7],"(DAG)":[8],"into":[9],"weighted":[11],"sum":[12],"of":[13,17,52,79,89,100,120,133,148,184,186],"small":[15],"number":[16],"paths":[18],"is":[19,178],"an":[20,86],"essential":[21],"task":[22],"in":[23,41,46,175,182],"operations":[24],"research":[25],"and":[26,61,114,152,155],"bioinformatics.":[27],"This":[28],"problem,":[29],"referred":[30],"to":[31,57,130],"as":[32,71,91],"Sparse":[33],"Flow":[34],"Decomposition":[35],"(SFD),":[36],"has":[37],"gained":[38],"significant":[39],"interest,":[40],"particular":[42],"for":[43,112],"its":[44],"application":[45],"RNA":[47],"transcript":[48],"multi-assembly,":[49],"the":[50,53,77,80,97,101,106,109,121,131,134,161,187,194],"identification":[51],"multiple":[54],"transcripts":[55],"corresponding":[56],"given":[59],"gene":[60],"their":[62],"relative":[63],"abundance.":[64],"Several":[65],"recent":[66,171],"approaches":[67,174],"cast":[68],"SFD":[69,90,149],"variants":[70,119],"integer":[72,172],"optimization":[73,173],"problems,":[74],"motivated":[75],"by":[76],"NP-hardness":[78],"formulations":[81,147],"they":[82],"consider.":[83],"We":[84],"propose":[85],"alternative":[87],"formulation":[88],"data":[93],"fitting":[94],"problem":[95,107],"conic":[98],"hull":[99],"polytope.":[103],"By":[104],"reformulating":[105],"polytope":[111],"compactness":[113],"solving":[115],"it":[116],"using":[117],"specific":[118],"Frank-Wolfe":[122],"algorithm,":[123],"we":[124],"obtain":[125],"method":[127,169],"converging":[128],"rapidly":[129],"minimizer":[132],"chosen":[135],"loss":[136],"function":[137],"while":[138],"producing":[139],"parsimonious":[141],"decomposition.":[142],"Our":[143],"approach":[144],"subsumes":[145],"previous":[146],"with":[150],"exact":[151],"inexact":[153],"flows":[154],"can":[156],"model":[157],"different":[158],"priors":[159],"error":[162],"distributions.":[163],"Computational":[164],"experiments":[165],"show":[166],"that":[167],"our":[168],"outperforms":[170],"runtime,":[176],"but":[177],"also":[179],"highly":[180],"competitive":[181],"terms":[183],"reconstruction":[185],"underlying":[188],"transcripts,":[189],"despite":[190],"not":[191],"explicitly":[192],"minimizing":[193],"solution":[195],"cardinality.":[196]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}