Abstrakti
Given a flow network, the Minimum Flow Decomposition (MFD) problem is finding the smallest possible set of weighted paths whose superposition equals the flow. It is a classical, strongly NP-hard problem that is proven to be useful in RNA transcript assembly and applications outside of Bioinformatics. We improve an existing ILP (Integer Linear Programming) model by Dias et al. [RECOMB 2022] for DAGs by decreasing the solver's search space using solution safety and several other optimizations. This results in a significant speedup compared to the original ILP, of up to 34× on average on the hardest instances. Moreover, we show that our optimizations apply also to MFD problem variants, resulting in speedups that go up to 219× on the hardest instances. We also developed an ILP model of reduced dimensionality for an MFD variant in which the solution path weights are restricted to a given set. This model can find an optimal MFD solution for most instances, and overall, its accuracy significantly outperforms that of previous greedy algorithms while being up to an order of magnitude faster than our optimized ILP.
Alkuperäiskieli | Englanti |
---|---|
Otsikko | 22nd International Symposium on Experimental Algorithms, SEA 2024 |
Toimittajat | Leo Liberti |
Kustantaja | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
ISBN (elektroninen) | 978-3-95977-325-6 |
DOI - pysyväislinkit | |
Tila | Julkaistu - heinäk. 2024 |
OKM-julkaisutyyppi | A4 Artikkeli konferenssijulkaisussa |
Tapahtuma | International Symposium on Experimental Algorithms - Vienna, Itävalta Kesto: 23 heinäk. 2024 → 26 heinäk. 2024 Konferenssinumero: 22 |
Julkaisusarja
Nimi | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Vuosikerta | 301 |
ISSN (painettu) | 1868-8969 |
Conference
Conference | International Symposium on Experimental Algorithms |
---|---|
Lyhennettä | SEA |
Maa/Alue | Itävalta |
Kaupunki | Vienna |
Ajanjakso | 23/07/2024 → 26/07/2024 |