Clustering huge protein sequence sets in linear time
Billions of metagenomic and genomic sequences fill up public datasets, which makes similarity clustering an important and time-critical analysis step. Here, the authors develop Linclust, an algorithm with linear time complexity that can cluster over a billion sequences within hours on a single serve...
Guardado en:
Autores principales: | Martin Steinegger, Johannes Söding |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2018
|
Materias: | |
Acceso en línea: | https://doaj.org/article/01cb78641dc94c18a3dea062537719c0 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Circumventing huge volume strain in alloy anodes of lithium batteries
por: Hongyi Li, et al.
Publicado: (2020) -
Huge magnetoresistance in topological insulator spin-valves at room temperature
por: Peng Tseng, et al.
Publicado: (2021) -
A linear time algorithm for minimum equitable dominating set in trees
por: Rana,Sohel, et al.
Publicado: (2021) -
Structural basis for energy transfer in a huge diatom PSI-FCPI supercomplex
por: Caizhe Xu, et al.
Publicado: (2020) -
Progressive pulmonary stenosis due to huge mediastinal thymoma
por: Murat Çap, et al.
Publicado: (2021)