Brubach, Brian
[VerfasserIn];
Ghurye, Jay
[VerfasserIn];
Pop, Mihai
[VerfasserIn];
Srinivasan, Aravind
[VerfasserIn]
;
Brian Brubach and Jay Ghurye and Mihai Pop and Aravind Srinivasan
[MitwirkendeR]
Better Greedy Sequence Clustering with Fast Banded Alignment
Anmerkungen:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Beschreibung:
Comparing a string to a large set of sequences is a key subroutine in greedy heuristics for clustering genomic data. Clustering 16S rRNA gene sequences into operational taxonomic units (OTUs) is a common method used in studying microbial communities. We present a new approach to greedy clustering using a trie-like data structure and Four Russians speedup. We evaluate the running time of our method in terms of the number of comparisons it makes during clustering and show in experimental results that the number of comparisons grows linearly with the size of the dataset as opposed to the quadratic running time of other methods. We compare the clusters output by our method to the popular greedy clustering tool UCLUST. We show that the clusters we generate can be both tighter and larger.