open horizons "Levenshtein Distance" Pattern Matching for DNA Sequencing Data
Pattern Matching for DNA Sequencing Data Using Spring Batch and Levenshtein Distance Author : Wadï Mami E-mail : wmami@steg.com.tn/ didipostman77@gmail.com Date : 24/06/2022 DNA is a sequence of letters such as A, C, G, T. Searching for specific sequences is often difficult due to measurement errors, mutations or evolutionary alterations. Thus, similarity of two sequences using Levenshtein Distance is more useful than exact matches. So instead of Karp Rabin we will use Levenshtein Distance or Jaro_Winkler_Similarity by using Package org.apache.commons.text.similarity So Spring Batch + Levenshtein Distance or Jaro_Winkler Similarity = How Crispr cas9 Works due to (https://www.tudelft.nl/en/2018/tu-delft/mathematics-explains-why-crispr-cas9-sometimes-cuts-the-wrong-dna) Here the initial project https://didipostmanprojects.blogspot.com/2022/06/spring-...