A design of a parallel architecture for solving exact matching problem on DNA molecules

Area of Science:

• Bioinformatics
• Computer Science
• Computational Biology

Background:

• Exact string matching is crucial for analyzing DNA sequences.
• Sequential algorithms can be time-consuming for large genomic datasets.
• Computational intensity of DNA analysis necessitates faster processing methods.

Purpose of the Study:

• To introduce a novel parallel algorithm for exact string matching on DNA molecules.
• To present a suitable parallel architecture for implementing the proposed algorithm.
• To enhance the speed of DNA sequence comparison for computational applications.

Main Methods:

• Development of a parallel algorithm for simultaneous comparison of patterns within DNA strings.
• Design of a parallel architecture comprising processing elements grouped into clusters.
• Implementation of the algorithm on the proposed architecture to perform matching in one clock cycle.

Main Results:

• The parallel algorithm significantly outperforms traditional sequential algorithms in speed.
• The entire exact string matching process is completed within a single clock cycle.
• The presented architecture effectively supports the parallel matching operations.

Conclusions:

• The developed parallel algorithm and architecture offer a substantial speed improvement for exact string matching in DNA.
• This work represents a significant advancement towards parallel processing solutions for computationally intensive DNA analysis.
• The approach has the potential to accelerate various applications in bioinformatics and computational genomics.