Fleximer: Accurate Quantification of RNA-Seq via Variable-Length k-mers
暂无分享,去创建一个
Wei Wang | Zhao Yang | Ruirui Li | Jyun-Yu Jiang | Chelsea J.-T. Ju | Zhengliang Wu | Zhengliang L. Wu | C. Ju | Wei Wang | Zhao Yang | Jyun-Yu Jiang | Ruirui Li
[1] Michael Sammeth,et al. Complete Alternative Splicing Events Are Bubbles in Splicing Graphs , 2009, J. Comput. Biol..
[2] Robert Patro,et al. RapMap: a rapid, sensitive and accurate tool for mapping RNA-seq reads to transcriptomes , 2015, bioRxiv.
[3] Cole Trapnell,et al. TopHat2: accurate alignment of transcriptomes in the presence of insertions, deletions and gene fusions , 2013, Genome Biology.
[4] J. Ian Munro,et al. Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..
[5] VälimäkiNiko,et al. Compressed suffix tree---a basis for genome-scale sequence analysis , 2007 .
[6] Cole Trapnell,et al. Computational methods for transcriptome annotation and quantification using RNA-seq , 2011, Nature Methods.
[7] Nuno A. Fonseca,et al. Expression Atlas update—an integrated database of gene and protein expression in humans, animals and plants , 2015, Nucleic Acids Res..
[8] Y. Xing,et al. Detection of splice junctions from paired-end RNA-seq data by SpliceMap , 2010, Nucleic acids research.
[9] H. Koltai,et al. Specificity of DNA microarray hybridization: characterization, effectors and approaches for data correction , 2008, Nucleic acids research.
[10] Stefan Kurtz,et al. REPuter: fast computation of maximal repeats in complete genomes , 1999, Bioinform..
[11] Derek Y. Chiang,et al. MapSplice: Accurate mapping of RNA-seq reads for splice junction discovery , 2010, Nucleic acids research.
[12] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.
[13] Martin Farach-Colton,et al. Optimal Suffix Tree Construction with Large Alphabets , 1997, FOCS.
[14] Richard M. Karp,et al. Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..
[15] M. Farach. Optimal suffix tree construction with large alphabets , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[16] Xerox Polo,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976 .
[17] Enno Ohlebusch,et al. Efficient multiple genome alignment , 2002, ISMB.
[18] Haixu Tang,et al. Splicing graphs and EST assembly problem , 2002, ISMB.
[19] Kunihiko Sadakane,et al. Compressed Suffix Trees with Full Functionality , 2007, Theory of Computing Systems.
[20] John Riedl,et al. Generalized suffix trees for biological sequence data: applications and implementation , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.
[21] Wei Wang,et al. RNA-Skim: a rapid method for RNA-Seq quantification at transcript level , 2014, Bioinform..
[22] Alyssa C. Frazee,et al. Polyester: Simulating RNA-Seq Datasets With Differential Transcript Expression , 2014, bioRxiv.
[23] Philip E. Burian,et al. Principles Driven Leadership: Thoughts, Observations And Conceptual Model , 2013, BIOINFORMATICS 2013.
[24] Esko Ukkonen,et al. On-line construction of suffix trees , 1995, Algorithmica.
[25] Alexander Schliep,et al. Selecting signature oligonucleotides to identify organisms using DNA arrays , 2002, Bioinform..
[26] Lior Pachter,et al. Near-optimal probabilistic RNA-seq quantification , 2016, Nature Biotechnology.
[27] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.
[28] Robert Patro,et al. Sailfish: Alignment-free Isoform Quantification from RNA-seq Reads using Lightweight Algorithms , 2013, ArXiv.
[29] Rob Patro,et al. Sailfish enables alignment-free isoform quantification from RNA-seq reads using lightweight algorithms , 2013, Nature Biotechnology.
[30] B. Wilhelm,et al. RNA-Seq-quantitative measurement of expression through massively parallel RNA-sequencing. , 2009, Methods.