2022
DOI: 10.48550/arxiv.2201.10372
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Safety and Completeness in Flow Decompositions for RNA Assembly

Abstract: Decomposing a network flow into weighted paths is a problem with numerous applications, ranging from networking, transportation planning to bioinformatics. In some applications we look for any decomposition that is optimal with respect to some property, such as number of paths used, robustness to edge deletion, or length of the longest path. However, in many bioinformatic applications, we seek a specific decomposition where the paths correspond to some underlying data that generated the flow. For realistic inp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 45 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?