1 Department of Mathematics and Computer Science (IMADA), Faculty of Science, SDU2 Computer Science, Department of Mathematics and Computer Science (IMADA), Faculty of Science, SDU3 unknown4 Department of Mathematics and Computer Science (IMADA), Faculty of Science, SDU
With the availability of newer and cheaper sequencing methods, genomic data are being generated at an increasingly fast pace. In spite of the high degree of complexity of currently available search routines, the massive number of sequences available virtually prohibits quick and correct identification of large groups of sequences sharing common traits. Hence, there is a need for clustering tools for automatic knowledge extraction enabling the curation of large-scale databases. Current sophisticated approaches on sequence clustering are based on pairwise similarity matrices. This is impractical for databases of hundreds of thousands of sequences as such a similarity matrix alone would exceed the available memory. In this paper, a new approach called MultiLevel Clustering (MLC) is proposed which avoids a majority of sequence comparisons, and therefore, significantly reduces the total runtime for clustering. An implementation of the algorithm allowed clustering of all 344,239 ITS (Internal Transcribed Spacer) fungal sequences from GenBank utilizing only a normal desktop computer within 22 CPU-hours whereas the greedy clustering method took up to 242 CPU-hours.
Scientific Reports, 2014, Vol 4
INTERNAL TRANSCRIBED SPACER PROTEIN SEQUENCES DNA SEARCH GENERATION ALGORITHM FAMILIES HOMOLOGY BLAST