On the Representation of de Bruijn Graphs
暂无分享,去创建一个
[1] Fabrizio Luccio,et al. Compressing and indexing labeled trees, with applications , 2009, JACM.
[2] Amar Mukherjee,et al. The Burrows-Wheeler Transform:: Data Compression, Suffix Arrays, and Pattern Matching , 2008 .
[3] M. Schatz,et al. Algorithms Gage: a Critical Evaluation of Genome Assemblies and Assembly Material Supplemental , 2008 .
[4] F. Raymond,et al. which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Ray Meta: scalable de novo metagenome assembly and profiling , 2012 .
[5] A. Gnirke,et al. High-quality draft assemblies of mammalian genomes from massively parallel sequence data , 2010, Proceedings of the National Academy of Sciences.
[6] R. Durbin,et al. Efficient de novo assembly of large genomes using compressed data structures. , 2012, Genome research.
[7] Yang Li,et al. Memory Efficient Minimum Substring Partitioning , 2013, Proc. VLDB Endow..
[8] Einar Andreas Rødland,et al. Compact representation of k-mer de Bruijn graphs for genome read assembly , 2013, BMC Bioinformatics.
[9] Rayan Chikhi,et al. Space-Efficient and Exact de Bruijn Graph Representation Based on a Bloom Filter , 2012, WABI.
[10] Steven L Salzberg,et al. Fast gapped-read alignment with Bowtie 2 , 2012, Nature Methods.
[11] Gregory Kucherov,et al. Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs , 2013, WABI.
[12] Michael Roberts,et al. A Preprocessor for Shotgun Assembly of Large Genomes , 2004, J. Comput. Biol..
[13] D. J. Wheeler,et al. A Block-sorting Lossless Data Compression Algorithm , 1994 .
[14] Thomas C. Conway,et al. Succinct data structures for assembling large genomes , 2010, Bioinform..
[15] Huanming Yang,et al. De novo assembly of human genomes with massively parallel short read sequencing. , 2010, Genome research.
[16] Dominique Lavenier,et al. DSK: k-mer counting with very low memory usage , 2013, Bioinform..
[17] Kunihiko Sadakane,et al. Succinct de Bruijn Graphs , 2012, WABI.
[18] Mihai Pop,et al. Exploiting sparseness in de novo genome assembly , 2012, BMC Bioinformatics.
[19] Michael Roberts,et al. Reducing storage requirements for biological sequence comparison , 2004, Bioinform..
[20] P. Pevzner. 1-Tuple DNA sequencing: computer analysis. , 1989, Journal of biomolecular structure & dynamics.
[21] Inanç Birol,et al. Assembling the 20 Gb white spruce (Picea glauca) genome from whole-genome shotgun sequencing data , 2013, Bioinform..
[22] Shoshana Neuburger,et al. The Burrows-Wheeler transform: data compression, suffix arrays, and pattern matching by Donald Adjeroh, Timothy Bell and Amar Mukherjee Springer, 2008 , 2010 .
[23] Sergey I. Nikolenko,et al. SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing , 2012, J. Comput. Biol..
[24] Richard Durbin,et al. Sequence analysis Fast and accurate short read alignment with Burrows – Wheeler transform , 2009 .
[25] Heng Li,et al. Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly , 2012, Bioinform..
[26] G. McVean,et al. De novo assembly and genotyping of variants using colored de Bruijn graphs , 2011, Nature Genetics.
[27] Travis Gagie. Bounds from a card trick , 2012, J. Discrete Algorithms.
[28] Arend Hintze,et al. Scaling metagenome sequence assembly with probabilistic de Bruijn graphs , 2011, Proceedings of the National Academy of Sciences.
[29] Joshua M. Stuart,et al. Genome 10K: a proposal to obtain whole-genome sequence for 10,000 vertebrate species. , 2009, The Journal of heredity.
[30] Richard Stong,et al. Choice Bounds: 11132 , 2007, Am. Math. Mon..
[31] Giovanni Manzini,et al. Opportunistic data structures with applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[32] Jared T. Simpson,et al. Efficient construction of an assembly string graph using the FM-index , 2010, Bioinform..
[33] S. Koren,et al. Assembly algorithms for next-generation sequencing data. , 2010, Genomics.
[34] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[35] Siu-Ming Yiu,et al. SOAP2: an improved ultrafast tool for short read alignment , 2009, Bioinform..
[36] N. Friedman,et al. Trinity: reconstructing a full-length transcriptome without a genome from RNA-Seq data , 2011, Nature Biotechnology.
[37] Steven J. M. Jones,et al. Abyss: a Parallel Assembler for Short Read Sequence Data Material Supplemental Open Access , 2022 .
[38] E. Birney,et al. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. , 2008, Genome research.
[39] Michael S. Waterman,et al. A New Algorithm for DNA Sequence Assembly , 1995, J. Comput. Biol..