Implementation of longest common subsequence using multiple asynchronous operations via future library.
The input file should start with the number of sequences, space and initial sequence. In next lines add the sequences to be matched versus the initial sequence. The find the example input file named "input.txt" in the repo.