A design of a parallel architecture for solving exact matching problem on DNA molecules.
This paper describes a parallel algorithm and its needed architecture for solving exact string matching problem on DNA molecules. The parallel algorithm is considered much more faster than sequential algorithms used to perform exact string matching; the whole matching process between a given string and a pattern is performed in only one clock cycle by activating a number of processing elements and grouping them into clusters that perform the comparison operation between the Pattern and the string simultaneously. A simple parallel architecture is also presented as the algorithms is performed using this parallel architecture. The system is considered a step towards a complete parallel processing architecture to solve computationally intensive applications of DNA.
Khaled
Heba
H
Ain Shams University, Faculty of Computer & Information Science, Cairo.
Faheem
Hossam M
HM
Hasan
Tayseer
T
Ghoneimy
Saeed
S
D001483:Base Sequence; D039301:Computers, Molecular; D004247:DNA / Q000737:chemistry*; D016247:Information Storage and Retrieval / Q000379:methods*; D008969:Molecular Sequence Data; D017422:Sequence Analysis, DNA / Q000379:methods*; D012815:Signal Processing, Computer-Assisted
D004247:DNA