Cargando…
SlideSort: all pairs similarity search for short reads
Motivation: Recent progress in DNA sequencing technologies calls for fast and accurate algorithms that can evaluate sequence similarity for a huge amount of short reads. Searching similar pairs from a string pool is a fundamental process of de novo genome assembly, genome-wide alignment and other im...
Autores principales: | Shimizu, Kana, Tsuda, Koji |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3035798/ https://www.ncbi.nlm.nih.gov/pubmed/21148542 http://dx.doi.org/10.1093/bioinformatics/btq677 |
Ejemplares similares
-
RAPSearch: a fast protein similarity search tool for short reads
por: Ye, Yuzhen, et al.
Publicado: (2011) -
Starcode: sequence clustering based on all-pairs search
por: Zorita, Eduard, et al.
Publicado: (2015) -
A sensitive short read homology search tool for paired-end read sequencing data
por: Techa-Angkoon, Prapaporn, et al.
Publicado: (2017) -
PoSSuM: a database of similar protein–ligand binding and putative pockets
por: Ito, Jun-Ichi, et al.
Publicado: (2012) -
Efficient privacy-preserving string search and an application in genomics
por: Shimizu, Kana, et al.
Publicado: (2016)