.png){kind=icon}
返回
Accurate Flow Decomposition via Robust Integer Linear Programming
.png){kind=icon}
PRE
AI
DOI：10.1109/TCBB.2024.3433523.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Minimum flow decomposition (MFD) is a common problem across various fields of Computer Science, where a flow is decomposed into a minimum set of weighted paths. However, in Bioinformatics applications, such as RNA transcript or quasi-species assembly, the flow is erroneous since it is obtained from noisy read coverages. Typical generalizations of the MFD problem to handle errors are based on least-squares formulations or modelling the erroneous flow values as ranges. All of these are thus focused on error handling at the level of individual edges. In this paper, we interpret the flow decomposition problem as a robust optimization problem and lift error-handling from individual edges to solution paths. As such, we introduce a new minimum path-error flow decomposition problem, for which we give an Integer Linear Programming formulation. Our experimental results reveal that our formulation can account for errors significantly better, by lowering the inaccuracy rate by 30-50% compared to previous error-handling formulations, with computational requirements that remain practical.
Keyword:
Bioinformatics
Genomics
RNA
Splicing
Assembly
Integer linear programming
Sequential analysis
Flow decomposition
integer programming
network flow
uncertainty
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
Accurate assembly of transcripts through phase-preserving graph decomposition.png)
NATURE BIOTECHNOLOGY
OAAI
NATURE BIOTECHNOLOGYIF41.7
OAAI分享收藏
The multiassembly problem: Reconstructing multiple transcript isoforms from EST fragment mixturesGENOME RESEARCHOAAI
GENOME RESEARCHIF5.5
OAAI分享收藏StringTie enables improved reconstruction of a transcriptome from RNA-seq readsStringTie可以改善rna-seq读取的转录组重建NATURE BIOTECHNOLOGYOAAI
NATURE BIOTECHNOLOGYIF41.7
OAAI分享收藏
查看更多内容