String Matching Evaluation Methods for DNA Comparison
Izzat Mahmoud Alsmadi, Maryam Nuser · 2012
Studying patterns in DNA sequences has been for years the subject of many research papers in bioinformatics. This paper evaluates two algorithms used for DNA comparison. Those are: Longest Common Substring and Subsequence (LCS, LCSS). Evaluation is performed based on the different code implementations for those two algorithms. Accuracy and performance are the two major criteria that are used for the evaluation of algorithms’ implementation. Results showed that while those two algorithms are popular, their implementations are not consistent through research papers or websites that use and implement those algorithms for DNA sequence comparison.