Implementation of several algorithms solving the classical bioinformatics problems, such as substring search, sequence alignment, matching regular expressions, finding k-similar and minimal window for two strings.
Finds the smallest substring containing the characters of a given string in O(n+m) time complexity. Utilizing a sliding window algorithm. Java Solution
Add a description, image, and links to the window-substring topic page so that developers can more easily learn about it.
To associate your repository with the window-substring topic, visit your repo's landing page and select "manage topics."