2008 NASA/ESA Conference on Adaptive Hardware and Systems 2008
DOI: 10.1109/ahs.2008.16
|View full text |Cite
|
Sign up to set email alerts
|

A High Performance Reconfigurable Core for Motif Searching Using Profile HMM

Abstract: A common task in bioinformatics is

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 13 publications
(13 citation statements)
references
References 14 publications
0
13
0
Order By: Relevance
“…Early proposals [12][13][14][15] of hardware accelerator for profile based similarity search considered an (over) simplified version of the algorithm in which the feed-back loop is ignored as such a simplification has a relatively limited impact on the actual quality of results of the algorithm.…”
Section: Early Implementationsmentioning
confidence: 99%
“…Early proposals [12][13][14][15] of hardware accelerator for profile based similarity search considered an (over) simplified version of the algorithm in which the feed-back loop is ignored as such a simplification has a relatively limited impact on the actual quality of results of the algorithm.…”
Section: Early Implementationsmentioning
confidence: 99%
“…To do so, it implements a well-known DP algorithm called the Viterbi algorithm [16]. This algorithm calculates a set of DP matrices (corresponding to states M, I, and D) and vectors (corresponding to states N, B, E, C, and J) by means of a set of recurrence equations found in [10,12,13] and shown in Figure 2. Each state has transition probabilities to other states and the M and I states have emission probabilities in order to model the statistical behavior of the protein family.…”
Section: IImentioning
confidence: 99%
“…As a result, it finds the best (most probable) alignment and its score for the query sequence with the given model. As the routine that implements the Viterbi algorithm in HMMER is the most time consuming of the search and comparison programs, most works [9][10][11][12][13][14]17] focus in accelerating its execution by proposing a pre-filter phase which only calculates the similarity score for the algorithm. Then, if the similarity score is good, the entire query sequence is reprocessed by the software to produce the alignment.…”
Section: IImentioning
confidence: 99%
See 2 more Smart Citations