Finds the smallest substring containing the characters of a given string in O(n+m) time complexity. Utilizing a sliding window algorithm. Java Solution

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.