Simulating the DNA Overlap Graph in Succinct Space
暂无分享,去创建一个
Travis Gagie | Gonzalo Navarro | Diego Díaz-Domínguez | G. Navarro | T. Gagie | Diego Díaz-Domínguez
[1] Jared T. Simpson,et al. Efficient construction of an assembly string graph using the FM-index , 2010, Bioinform..
[2] Gonzalo Navarro,et al. Succinct Suffix Arrays based on Run-Length Encoding , 2005, Nord. J. Comput..
[3] Hiroki Arimura,et al. Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications , 2001, CPM.
[4] Christina Boucher,et al. Variable-Order de Bruijn Graphs , 2014, 2015 Data Compression Conference.
[5] Kunihiko Sadakane,et al. A Linear-Time Burrows-Wheeler Transform Using Induced Sorting , 2009, SPIRE.
[6] R. Durbin,et al. Efficient de novo assembly of large genomes using compressed data structures. , 2012, Genome research.
[7] Enno Ohlebusch,et al. Replacing suffix trees with enhanced suffix arrays , 2004, J. Discrete Algorithms.
[8] Michael Roberts,et al. The MaSuRCA genome assembler , 2013, Bioinform..
[9] Paolo Ferragina,et al. Indexing compressed text , 2005, JACM.
[10] Lior Pachter,et al. Near-optimal probabilistic RNA-seq quantification , 2016, Nature Biotechnology.
[11] Dong Kyue Kim,et al. Linear-Time Construction of Suffix Arrays , 2003, CPM.
[12] Eugene W. Myers,et al. The fragment assembly string graph , 2005, ECCB/JBI.
[13] Roberto Grossi,et al. High-order entropy-compressed text indexes , 2003, SODA '03.
[14] E. Birney,et al. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. , 2008, Genome research.
[15] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.
[16] Gonzalo Navarro,et al. Compressed full-text indexes , 2007, CSUR.
[17] Sergey I. Nikolenko,et al. SPAdes: A New Genome Assembly Algorithm and Its Applications to Single-Cell Sequencing , 2012, J. Comput. Biol..
[18] David Richard Clark,et al. Compact pat trees , 1998 .
[19] Paola Bonizzoni,et al. Constructing String Graphs in External Memory , 2014, WABI.
[20] Srinivas Aluru,et al. Space efficient linear time construction of suffix arrays , 2005, J. Discrete Algorithms.
[21] D. J. Wheeler,et al. A Block-sorting Lossless Data Compression Algorithm , 1994 .
[22] Kunihiko Sadakane,et al. Fully Functional Static and Dynamic Succinct Trees , 2009, TALG.
[23] Djamal Belazzougui,et al. Linear time construction of compressed text indices in compact space , 2014, STOC.
[24] Kunihiko Sadakane,et al. Succinct de Bruijn Graphs , 2012, WABI.
[25] Kunihiko Sadakane,et al. MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph , 2014, Bioinform..
[26] Gonzalo Navarro,et al. Faster Compressed Suffix Trees for Repetitive Collections , 2016, ACM J. Exp. Algorithmics.
[27] Siu-Ming Yiu,et al. IDBA - A Practical Iterative de Bruijn Graph De Novo Assembler , 2010, RECOMB.
[28] G. McVean,et al. De novo assembly and genotyping of variants using colored de Bruijn graphs , 2011, Nature Genetics.
[29] Gonzalo Navarro,et al. Compact Data Structures - A Practical Approach , 2016 .
[30] Paul Medvedev,et al. Compacting de Bruijn graphs from sequencing data quickly and in low memory , 2016, Bioinform..
[31] Peter Sanders,et al. Linear work suffix array construction , 2006, JACM.
[32] Aaron L. Halpern,et al. Consensus generation and variant detection by Celera Assembler , 2008, Bioinform..
[33] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[34] Alistair Moffat,et al. From Theory to Practice: Plug and Play with Succinct Data Structures , 2013, SEA.