Feasibility of flow decomposition with subpath constraints in linear time

DOI10.4230/LIPICS.WABI.2022.17MaRDI QIDQ6587078zbMATH OpenFDO

Authors Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru

Publication date 13 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.WABI.2022.17

zbMATH Keywords

flow decompositionflow networkssubpath constraints

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Genetics and epigenetics (92D10)

Recommendations

• Flow Decomposition with Subpath Constraints
• A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
• Safety and completeness in flow decompositions for RNA assembly
• Fast, flexible, and exact minimum flow decompositions via ILP
• Integral flow decomposition with minimum longest path length

This page was built for publication: Feasibility of flow decomposition with subpath constraints in linear time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587078)