![]() |
Volumn , Issue , 2002, Pages 162-169
|
A parallel Smith-Waterman algorithm based on divide and conquer
|
Author keywords
biological sequence alignment; divide and conquer; dynamic programming; parallel
|
Indexed keywords
BIOINFORMATICS;
COMPUTER ARCHITECTURE;
DYNAMIC PROGRAMMING;
MEMORY ARCHITECTURE;
MOLECULAR BIOLOGY;
PARALLEL ARCHITECTURES;
BIOLOGICAL SEQUENCE ALIGNMENT;
BIOLOGICAL SEQUENCES;
CRITICAL PROBLEMS;
DIVIDE AND CONQUER;
MEMORY REQUIREMENTS;
PARALLEL;
SEQUENCE COMPARISONS;
SMITH-WATERMAN ALGORITHM;
ALGORITHMS;
|
EID: 84964766181
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICAPP.2002.1173568 Document Type: Conference Paper |
Times cited : (43)
|
References (10)
|