Cargando…
Fast Search of Thousands of Short-Read Sequencing Experiments
We introduce Sequence Bloom Trees, a method for querying thousands of short-read sequencing experiments by sequence 485 times faster than existing approaches. The approach searches large data archives for all experiments that involve a given sequence. We use Sequence Bloom Trees to search 2652 human...
Autores principales: | Solomon, Brad, Kingsford, Carl |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4804353/ https://www.ncbi.nlm.nih.gov/pubmed/26854477 http://dx.doi.org/10.1038/nbt.3442 |
Ejemplares similares
-
Reference-based compression of short-read sequences using path encoding
por: Kingsford, Carl, et al.
Publicado: (2015) -
Assembly complexity of prokaryotic genomes using short reads
por: Kingsford, Carl, et al.
Publicado: (2010) -
Data-dependent bucketing improves reference-free compression of sequencing reads
por: Patro, Rob, et al.
Publicado: (2015) -
Assessing the benefits of using mate-pairs to resolve repeats in de novo short-read prokaryotic assemblies
por: Wetzel, Joshua, et al.
Publicado: (2011) -
RAPSearch: a fast protein similarity search tool for short reads
por: Ye, Yuzhen, et al.
Publicado: (2011)