Keywords
Cluster analysisMetagenomicsComputer scienceRedundancy (engineering)Sequence (biology)Data miningAnnotationSet (abstract data type)Computational biologySimilarity (geometry)BiologyArtificial intelligenceGeneticsGene
Affiliated Institutions
Related Publications
Search and clustering orders of magnitude faster than BLAST
Abstract Motivation: Biological sequence data is accumulating rapidly, motivating the development of improved high-throughput methods for sequence classification. Results: UBLAS...
VSEARCH: a versatile open source tool for metagenomics
Background VSEARCH is an open source and free of charge multithreaded 64-bit tool for processing and preparing metagenomics, genomics and population genomics nucleotide sequence...
Objective Criteria for the Evaluation of Clustering Methods
Abstract Many intuitively appealing methods have been suggested for clustering data, however, interpretation of their results has been hindered by the lack of objective criteria...
pGenTHREADER and pDomTHREADER: new methods for improved protein fold recognition and superfamily discrimination
Abstract Motivation: Generation of structural models and recognition of homologous relationships for unannotated protein sequences are fundamental problems in bioinformatics. Im...
Automated generation of heuristics for biological sequence comparison
Abstract Background Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to i...
Publication Info
- Year
- 2018
- Type
- article
- Volume
- 9
- Issue
- 1
- Pages
- 2542-2542
- Citations
- 891
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
891
OpenAlex
Cite This
Martin Steinegger,
Johannes Söding
(2018).
Clustering huge protein sequence sets in linear time.
Nature Communications
, 9
(1)
, 2542-2542.
https://doi.org/10.1038/s41467-018-04964-5
Identifiers
- DOI
- 10.1038/s41467-018-04964-5