A novel min-cost flow method for estimating transcript expression with RNA-Seq

BMC Bioinformatics

Volumn 14, Issue SUPPL.5, 2013, Pages

  Tomescu, Alexandru I ^a   Kuosmanen, Anna ^a   Rizzi, Romeo ^b   Mäkinen, Veli ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE SPLICING; GENERAL METHOD; HEURISTICS AND APPROXIMATIONS; HIGH-THROUGHPUT; POLYNOMIAL-TIME; PREDICTION ACCURACY; SPLICING GRAPHS; SUM OF SQUARES;

COST ACCOUNTING; POLYNOMIAL APPROXIMATION; RNA; TISSUE; TRANSCRIPTION;

FLOW GRAPHS;

RNA ISOFORM;

ALGORITHM; ALTERNATIVE RNA SPLICING; ARTICLE; COMPUTER PROGRAM; GENE EXPRESSION PROFILING; HUMAN; METABOLISM; METHODOLOGY; SEQUENCE ANALYSIS; STATISTICAL MODEL; PROCEDURES;

ALGORITHMS; ALTERNATIVE SPLICING; GENE EXPRESSION PROFILING; HUMANS; MODELS, STATISTICAL; RNA ISOFORMS; SEQUENCE ANALYSIS, RNA; SOFTWARE;

EID: 84876157687     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-14-S5-S15     Document Type: Article

References (25)

1. Mortazavi A, Williams BAA, McCue K, Schaeffer L, Wold B. Mapping and quantifying mammalian transcriptomes by RNA-Seq. Nature Methods 2008, 5:621-628. 10.1038/nmeth.1226, 18516045.
2. Pepke S, Wold B, Mortazavi A. Computation for ChIP-seq and RNA-seq studies. Nature methods 2009, 6:(11):s22-s32.
3. Shah S, et al. The clonal and mutational evolution spectrum of primary triple-negative breast cancers. Nature 2012, 486:(7403):395-399.
4. Trapnell C, et al. Transcript assembly and quantification by RNA-Seq reveals unannotated transcripts and isoform switching during cell differentiation. Nature Biotechnology 2010, 28:511-515. 10.1038/nbt.1621, 3146043, 20436464.
5. Heber S, Alekseyev M, Sze SH, Tang H, Pevzner PA. Splicing graphs and EST assembly problem. Bioinformatics 2002, 18(suppl 1):S181-S188. 10.1093/bioinformatics/18.suppl_1.S181, 12386001.
6. Lin YY, Dao P, Hach F, Bakhshi M, Mo F, Lapuk A, Collins C, Sahinalp SC. CLIIQ: Accurate Comparative Detection and Quantification of Expressed Isoforms in a Population. Proc Algorithms in Bioinformatics - 12th International Workshop, WABI 2012, Volume 7534 of Lecture Notes in Computer Science 2012, 178-189. Springer.
7. Li JJ, Jiang CR, Brown JB, Huang H, Bickel PJ. Sparse linear modeling of next-generation mRNA sequencing (RNA-Seq) data for isoform discovery and abundance estimation. Proc Natl Acad Sci USA 2011, 108(50):19867-19872. 10.1073/pnas.1113972108, 3250192, 22135461.
8. Feng J, Li W, Jiang T. Inference of Isoforms from Short Sequence Reads. RECOMB, Volume 6044 of Lecture Notes in Computer Science 2010, 138-157. Springer, Berger B.
9. Li W, Feng J, Jiang T. IsoLasso: a LASSO regression approach to RNA-Seq based transcriptome assembly. J Comput Biol 2011, 18(11):1693-707. 10.1089/cmb.2011.0171, 3216102, 21951053.
10. Guttman M, Garber M, Levin JZ, Donaghey J, Robinson J, Adiconis X, Fan L, Koziol MJ, Gnirke A, Nusbaum C, Rinn JL, Lander ES, Regev A. Ab initio reconstruction of cell type-specific transcriptomes in mouse reveals the conserved multi-exonic structure of lincRNAs. Nat Biotechnol 2010, 28(5):503-510. 10.1038/nbt.1633, 2868100, 20436462.
11. Xing Y, Resch A, Lee C. The multiassembly problem: reconstructing multiple transcript isoforms from EST fragment mixtures. Genome Res 2004, 14:(3):426-441. 353230, 14962984.
12. Namiki T, Hachiya T, Tanaka H, Sakakibara Y. MetaVelvet: an extension of Velvet assembler to de novo metagenome assembly from short sequence reads. Nucleic Acids Res 2012, 40:e155. 10.1093/nar/gks678, 3488206, 22821567.
13. Ahuja RK, Magnanti TL, Orlin JB. Network Flows: Theory, Algorithms, and Applications 1993, Prentice-Hall, Inc.
14. Vatinlen B, Chauvet F, Chrétienne P, Mahey P. Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths. European Journal of Operational Research 2008, 185(3):1390-1401.
15. Hartman T, Hassidim A, Kaplan H, Raz D, Segalov M. How to split a flow?. INFOCOM 2012, 828-836. Greenberg AG, Sohraby K, IEEE.
16. Koch R, Skutella M, Spenke I. Maximum k-Splittable s, t-Flows. Theory of Computing Systems 2008, 43:56-66., http://dx.doi.org/10.1007/s00224-007-9068-8
17. Salazar F, Skutella M. Single-source k-splittable min-cost flows. Oper Res Lett 2009, 37(2):71-74.
18. Van Der Heijden PG, Cruyff M, Van Houwelingen HC. Estimating the Size of a Criminal Population from Police Records Using the Truncated Poisson Regression Model. Statistica Neerlandica 2003, 57(3):289-304.
19. Minoux M. Solving integer minimum cost flows with separable convex cost objective polynomially. Netflow at Pisa, Volume 26 of Mathematical Programming Studies 1986, 237-239. Springer Berlin Heidelberg, Gallo G, Sandi C., http://dx.doi.org/10.1007/BFb0121104
20. Weintraub A. A Primal Algorithm to Solve Network Flow Problems with Convex Costs. Management Science 1974, 21:87-97., http://EconPapers.repec.org/RePEc:inm:ormnsc:v:21:y:1974:i:1:p:87-97
21. Lemon Graph Library Lemon Graph Library., http://lemon.cs.elte.hu/trac/lemon/
22. Traph source code and experiment data Traph source code and experiment data., http://cs.helsinki.fi/gsa/traph/
23. Cilibrasi R, Vitányi PMB. Clustering by compression. IEEE Transactions on Information Theory 2005, 51(4):1523-1545.
24. RNASeqReadSimulator RNASeqReadSimulator., http://www.cs.ucr.edu/~liw/rnaseqreadsimulator.html
25. Trapnell C, Pachter L, Salzberg SL. TopHat: discovering splice junctions with RNA-Seq. Bioinformatics 2009, 25(9):1105-1111. 10.1093/bioinformatics/btp120, 2672628, 19289445.