Identifying DNA sequence by using stream matching techniques

摘要

In Bioinformatics there are frameworks in DNA sequences become the subject of many research papers. DNA sequencing is done by stream matching techniques. This paper assesses two algorithms that are used for DNA sequencing. These algorithms are- Maximum Common Sub stream (MCS) and Rabin-Karp (R-K) Algorithm. The evaluations of these two algorithms are performed with different code implementation and algorithm. For evaluation of algorithm's implementation, there are two criteria used that are accuracy and performance. In the result there shows that why those two algorithms are popular.