Clustering near-identical sequences for fast homology search

  • Authors:

  • Michael Cameron;Yaniv Bernstein;Hugh E. Williams

  • Affiliations:

  • School of Computer Science and Information Technology, RMIT University, Melbourne, Australia;School of Computer Science and Information Technology, RMIT University, Melbourne, Australia;Microsoft Corporation, Redmond, Washington

  • Venue:
  • RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new approach to managing redundancy in sequence databanks such as GenBank. We store clusters of near-identical sequences as a representative union-sequence and a set of corresponding edits to that sequence. During search, the query is compared to only the union-sequences representing each cluster; cluster members are then only reconstructed and aligned if the union-sequence achieves a sufficiently high score. Using this approach in BLAST results in a 27% reduction is collection size and a corresponding 22% decrease in search time with no significant change in accuracy. We also describe our method for clustering that uses fingerprinting, an approach that has been successfully applied to collections of text and web documents in Information Retrieval. Our clustering approach is ten times faster on the GenBank nonredundant protein database than the fastest existing approach, CD-HIT. We have integrated our approach into FSA-BLAST, our new Open Source version of BLAST, available from http://www.fsa-blast.org/. As a result, FSA-BLAST is twice as fast as NCBI-BLAST with no significant change in accuracy.