Parallel DNA sequencing with exact and approximate string-matching algorithms

String-matching algorithms are concerned with lo-cating specific patterns within larger strings or text files. This problem of exact sequence matching is studied in various fields of molecular biology, data compression, and information retrieval. Therefore, the goal of this paper is to address problems that string matching algorithms have when used on DNA sequences. The main obstacles are the pattern and text lengths that are used as input data. The main content and the whole goal is to adapt the parallel string matching problem to a larger size of text and adapt exact brute force to fit the idea of a DNA matching that can not have 100% matching. To achieve that idea is to implement naive k-mismatches that allow matching to 99% which is acceptable when talking about DNK sequences.