Khaled Heba, Faheem Hossam M, Hasan Tayseer, Ghoneimy Saeed
Ain Shams University, Faculty of Computer & Information Science, Cairo.
Biomed Sci Instrum. 2007;43:170-5.
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.
本文描述了一种用于解决DNA分子上精确字符串匹配问题的并行算法及其所需的架构。该并行算法被认为比用于执行精确字符串匹配的顺序算法快得多；通过激活多个处理元素并将它们分组为集群，在单个时钟周期内执行给定字符串与模式之间的整个匹配过程，这些集群同时执行模式与字符串之间的比较操作。还提出了一种简单的并行架构，因为该算法是使用此并行架构执行的。该系统被认为是迈向完整并行处理架构的一步，以解决DNA计算密集型应用。
