Proceedings of the 6th ACM Conference on Computing Frontiers 2009
DOI: 10.1145/1531743.1531755
|View full text |Cite
|
Sign up to set email alerts
|

Quantitative analysis of sequence alignment applications on multiprocessor architectures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…There are multiple levels of parallelism in the protein sequence alignment problem. The most frequently exploited is the embarrassingly parallel situation where a collection of query sequences has to be aligned to a database of candidate sequences [44]. The parallel strategy, to align one query sequence to a single candidate, is based on the FASTA Smith-Waterman code (ssearch) [35].…”
Section: Fasta Smith-watermanmentioning
confidence: 99%
See 1 more Smart Citation
“…There are multiple levels of parallelism in the protein sequence alignment problem. The most frequently exploited is the embarrassingly parallel situation where a collection of query sequences has to be aligned to a database of candidate sequences [44]. The parallel strategy, to align one query sequence to a single candidate, is based on the FASTA Smith-Waterman code (ssearch) [35].…”
Section: Fasta Smith-watermanmentioning
confidence: 99%
“…Similarly, the semaphore table can contain 4096 physical entries for Tags, Value, Head and Tail. This distribution would provide 32 bit Tag plus 12 bit Index semaphores, which gives 44 bit physical semaphores or 2 44 .…”
Section: Required Hardwarementioning
confidence: 99%