Item request has been placed!
×
Item request cannot be made.
×

Processing Request
Ryūtō: network-flow based transcriptome reconstruction.
Item request has been placed!
×
Item request cannot be made.
×

Processing Request
- معلومة اضافية
- المصدر:
Publisher: BioMed Central Country of Publication: England NLM ID: 100965194 Publication Model: Electronic Cited Medium: Internet ISSN: 1471-2105 (Electronic) Linking ISSN: 14712105 NLM ISO Abbreviation: BMC Bioinformatics Subsets: MEDLINE
- بيانات النشر:
Original Publication: [London] : BioMed Central, 2000-
- الموضوع:
- نبذة مختصرة :
Background: The rapid increase in High-throughput sequencing of RNA (RNA-seq) has led to tremendous improvements in the detection and reconstruction of both expressed coding and non-coding RNA transcripts. Yet, the complete and accurate annotation of the complex transcriptional output of not only the human genome has remained elusive. One of the critical bottlenecks in this endeavor is the computational reconstruction of transcript structures, due to high noise levels, technological limits, and other biases in the raw data.
Results: We introduce several new and improved algorithms in a novel workflow for transcript assembly and quantification. We propose an extension of the common splice graph framework that combines aspects of overlap and bin graphs and makes it possible to efficiently use both multi-splice and paired-end information to the fullest extent. Phasing information of reads is used to further resolve loci. The decomposition of read coverage patterns is modeled as a minimum-cost flow problem to account for the unavoidable non-uniformities of RNA-seq data.
Conclusion: Its performance compares favorably with state of the art methods on both simulated and real-life datasets. Ryūtō calls 1-4% more true transcripts, while calling 5-35% less false predictions compared to the next best competitor.
- References:
Bioinformatics. 2005 Sep 1;21 Suppl 2:ii79-85. (PMID: 16204131)
Cell. 2006 Jul 14;126(1):37-47. (PMID: 16839875)
Trends Genet. 2008 Jan;24(1):7-10. (PMID: 18054115)
Nat Methods. 2008 Jul;5(7):621-8. (PMID: 18516045)
Nat Genet. 2008 Dec;40(12):1413-5. (PMID: 18978789)
Biochim Biophys Acta. 2009 Jan;1792(1):14-26. (PMID: 18992329)
Nat Rev Genet. 2009 Jan;10(1):57-63. (PMID: 19015660)
BMC Genomics. 2009 Jan 24;10:47. (PMID: 19166620)
Nat Rev Genet. 2010 Jan;11(1):9-16. (PMID: 19935729)
Nat Biotechnol. 2010 May;28(5):503-10. (PMID: 20436462)
Nat Biotechnol. 2010 May;28(5):511-5. (PMID: 20436464)
Proc Natl Acad Sci U S A. 2010 Jun 8;107(23):10514-9. (PMID: 20498046)
Genome Biol. 2011;12(3):R22. (PMID: 21410973)
Nat Methods. 2011 Jun;8(6):469-77. (PMID: 21623353)
Genes Dev. 2011 Sep 15;25(18):1915-27. (PMID: 21890647)
BMC Bioinformatics. 2011 Dec 14;12 Suppl 14:S2. (PMID: 22373417)
Bioinformatics. 2013 Jan 1;29(1):15-21. (PMID: 23104886)
J Comput Biol. 2013 Mar;20(3):167-87. (PMID: 23461570)
Genome Biol. 2013 Apr 25;14(4):R36. (PMID: 23618408)
BMC Bioinformatics. 2013;14 Suppl 5:S15. (PMID: 23734627)
Bioinformatics. 2013 Nov 1;29(21):2669-77. (PMID: 23990416)
Nat Methods. 2013 Dec;10(12):1177-84. (PMID: 24185837)
Bioinformatics. 2014 Sep 1;30(17):2447-55. (PMID: 24813214)
Genome Biol. 2014 Jun 30;15(6):R86. (PMID: 24981968)
Nat Biotechnol. 2015 Mar;33(3):290-5. (PMID: 25690850)
Nat Methods. 2015 Apr;12(4):357-60. (PMID: 25751142)
Bioinformatics. 2015 Dec 15;31(24):3938-45. (PMID: 26338770)
Genome Biol. 2016 Oct 19;17(1):213. (PMID: 27760567)
R J. 2011 Dec;3(2):29-33. (PMID: 27942416)
Nat Biotechnol. 2017 Dec;35(12):1167-1169. (PMID: 29131147)
PLoS Comput Biol. 2017 Nov 27;13(11):e1005851. (PMID: 29176847)
Noncoding RNA. 2017 Jul 05;3(3):null. (PMID: 29657294)
- Grant Information:
DFG STA 850/19-2 within SPP 1738 Deutsche Forschungsgemeinschaft
- Contributed Indexing:
Keywords: Bin graph; Exon bins; Minimum-cost flow; RNA-seq; Splice graph; Transcript reconstruction
- الرقم المعرف:
0 (RNA, Messenger)
- الموضوع:
Date Created: 20190418 Date Completed: 20190603 Latest Revision: 20200225
- الموضوع:
20250114
- الرقم المعرف:
PMC6469118
- الرقم المعرف:
10.1186/s12859-019-2786-5
- الرقم المعرف:
30991937
No Comments.