Cargando…
A random-permutations-based approach to fast read alignment
BACKGROUND: Read alignment is a computational bottleneck in some sequencing projects. Most of the existing software packages for read alignment are based on two algorithmic approaches: prefix-trees and hash-tables. We propose a new approach to read alignment using random permutations of strings. RES...
Autor principal: | Lederman, Roy |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3622637/ https://www.ncbi.nlm.nih.gov/pubmed/23734846 http://dx.doi.org/10.1186/1471-2105-14-S5-S8 |
Ejemplares similares
-
ARYANA: Aligning Reads by Yet Another Approach
por: Gholami, Milad, et al.
Publicado: (2014) -
Re-alignment of the unmapped reads with base quality score
por: Peng, Xiaoqing, et al.
Publicado: (2015) -
Optimizing the evidence for linkage by permuting marker order
por: Jun, Gyungah, et al.
Publicado: (2005) -
STELLAR: fast and exact local alignments
por: Kehr, Birte, et al.
Publicado: (2011) -
Accelerating read mapping with FastHASH
por: Xin, Hongyi, et al.
Publicado: (2013)