• DocumentCode
    1952351
  • Title

    CAAD BLASTP: NCBI BLASTP Accelerated with FPGA-Based Accelerated Pre-Filtering

  • Author

    Park, Jin H. ; Qiu, Yunfei ; Herbordt, Martin C.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Boston Univ., Boston, MA, USA
  • fYear
    2009
  • fDate
    5-7 April 2009
  • Firstpage
    81
  • Lastpage
    87
  • Abstract
    NCBI BLAST has become the de facto standard in bioinformatic approximate string matching and so its acceleration is of fundamental importance. The problem is that it uses complex heuristics which make it difficult to simultaneously achieve both substantial speed-up and exact agreement with the original output. Our approach is to prefilter the database. To make this work we have developed a novel heuristic which we append to a previously described structure for ungapped alignment. This enables us to quickly reduce the database by factors of 300 and 1100, for the ungapped and gapped options, respectively, while rejecting no significant sequences. On current hardware we anticipate a speed-up of at least a factor of 10 for NCBI BLASTP, independent of sensitivity settings. This filter is portable to other BLAST codes, and other filters can be similarly integrated into NCBI BLAST.
  • Keywords
    bioinformatics; field programmable gate arrays; information filtering; string matching; Basic Local Alignment Search Tool; CAAD BLASTP; FPGA-based pre-filtering; NCBI BLASTP; bioinformatic approximate string matching; complex heuristics; database prefiltering; gapped options; ungapped options; Acceleration; Bioinformatics; Biological information theory; Databases; Design automation; Filters; Hardware; Polymers; Proteins; Sequences;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Field Programmable Custom Computing Machines, 2009. FCCM '09. 17th IEEE Symposium on
  • Conference_Location
    Napa, CA
  • Print_ISBN
    978-0-7695-3716-0
  • Type

    conf

  • DOI
    10.1109/FCCM.2009.27
  • Filename
    5290947