Abstract

Profile hidden Markov models (profile HMMs) are used as a popular bioinformatics tool for sensitive database searching, e.g. a set of not annotated protein sequences is compared to a database of profile HMMs to detect functional similarities. HMMer is a commonly used package for profile HMM-based methods. However, searching large databases with HMMer suffers from long runtimes on traditional computer architectures. These runtime requirements are likely to become even more severe due to the rapid growth in size of both sequence and model databases. In this paper, we present a new reconfigurable architecture to accelerate HMMer database searching. It is described how this leads to significant runtime savings on off-the-shelf field-programmable gate arrays (FPGAs).

Keywords

Computer scienceHidden Markov modelField-programmable gate arrayDatabaseField (mathematics)Set (abstract data type)ArchitectureMarkov chainArtificial intelligenceProgramming languageOperating systemMachine learning

Affiliated Institutions

Related Publications

Profile hidden Markov models.

Abstract The recent literature on profile hidden Markov model (profile HMM) methods and software is reviewed. Profile HMMs turn a multiple sequence alignment into a position-spe...

1998 Bioinformatics 5657 citations

Publication Info

Year
2007
Type
article
Pages
1-7
Citations
23
Access
Closed

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

23
OpenAlex
1
Influential
12
CrossRef

Cite This

Tim Oliver, Leow Yuan Yeow, Bertil Schmidt (2007). High Performance Database Searching with HMMer on FPGAs. 2007 IEEE International Parallel and Distributed Processing Symposium , 1-7. https://doi.org/10.1109/ipdps.2007.370448

Identifiers

DOI
10.1109/ipdps.2007.370448

Data Quality

Data completeness: 81%