Efficient Minimum Flow Decomposition via Integer Linear Programming

Minimum flow decomposition (MFD) is an NP-hard problem asking to decompose a network flow into a minimum set of paths (together with associated weights). Variants of it are powerful models in multiassembly problems in Bioinformatics, such as RNA assembly. Owing to its hardness, practical multiassemb...

Descripción completa

Detalles Bibliográficos
Autores principales: Dias, Fernando H.C., Williams, Lucia, Mumey, Brendan, Tomescu, Alexandru I.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Mary Ann Liebert, Inc., publishers 2022
Materias:
Research Articles
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9700332/
https://www.ncbi.nlm.nih.gov/pubmed/36260412
http://dx.doi.org/10.1089/cmb.2022.0257

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9700332/
https://www.ncbi.nlm.nih.gov/pubmed/36260412
http://dx.doi.org/10.1089/cmb.2022.0257

Ejemplares similares