Cargando…
Fast batch searching for protein homology based on compression and clustering
BACKGROUND: In bioinformatics community, many tasks associate with matching a set of protein query sequences in large sequence datasets. To conduct multiple queries in the database, a common used method is to run BLAST on each original querey or on the concatenated queries. It is inefficient since i...
Autores principales: | Ge, Hongwei, Sun, Liang, Yu, Jinghong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5697088/ https://www.ncbi.nlm.nih.gov/pubmed/29162030 http://dx.doi.org/10.1186/s12859-017-1938-8 |
Ejemplares similares
-
Fast filtering for RNA homology search
por: Kolbe, Diana L., et al.
Publicado: (2011) -
mbkmeans: Fast clustering for single cell data using mini-batch k-means
por: Hicks, Stephanie C., et al.
Publicado: (2021) -
Searching Remote Homology with Spectral Clustering with Symmetry in Neighborhood Cluster Kernels
por: Maulik, Ujjwal, et al.
Publicado: (2013) -
Faster sequence homology searches by clustering subsequences
por: Suzuki, Shuji, et al.
Publicado: (2015) -
Mechanisms of fast and stringent search in homologous pairing of double-stranded DNA
por: Bitran, Amir, et al.
Publicado: (2017)