An Efficient, Scalable and Exact Representation of High-Dimensional Color Information Enabled via de Bruijn Graph Search
Authors:
- 2 April 2019
- book chapter
- Published by Springer Nature
- p. 1-18
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- Oases:robustde novoRNA-seq assembly across the dynamic range of expression levelsBioinformatics, 2012
- Succinct de Bruijn Graphs2012
- Full-length transcriptome assembly from RNA-Seq data without a reference genomeNature Biotechnology, 2011
- ABySS: A parallel assembler for short read sequence dataGenome Research, 2009
- Velvet: Algorithms for de novo short read assembly using de Bruijn graphsGenome Research, 2008
- Approximating k-hop minimum-spanning treesOperations Research Letters, 2005
- An Eulerian path approach to DNA fragment assemblyProceedings of the National Academy of Sciences, 2001
- Compression of correlated bit-vectorsInformation Systems, 1991
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Efficient Storage and Retrieval by Content and Address of Static FilesJournal of the ACM, 1974