Cargando…
Acceleration of sequence clustering using longest common subsequence filtering
BACKGROUND: Huge numbers of genomes can now be sequenced rapidly with recent improvements in sequencing throughput. However, data analysis methods have not kept up, making it difficult to process the vast amounts of available sequence data. This increased processing time is especially critical in DN...
Autores principales: | Namiki, Youhei, Ishida, Takashi, Akiyama, Yutaka |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3654901/ https://www.ncbi.nlm.nih.gov/pubmed/23815271 http://dx.doi.org/10.1186/1471-2105-14-S8-S7 |
Ejemplares similares
-
GPU-Acceleration of Sequence Homology Searches with Database Subsequence Clustering
por: Suzuki, Shuji, et al.
Publicado: (2016) -
Protein-protein docking on hardware accelerators: comparison of GPU and MIC architectures
por: Shimoda, Takehiro, et al.
Publicado: (2015) -
Faster sequence homology searches by clustering subsequences
por: Suzuki, Shuji, et al.
Publicado: (2015) -
An OpenMP-based tool for finding longest common subsequence in bioinformatics
por: Shikder, Rayhan, et al.
Publicado: (2019) -
Highly precise protein-protein interaction prediction based on consensus between template-based and de novo docking methods
por: Ohue, Masahito, et al.
Publicado: (2013)