This code solves genetic string mapping problem using best first search. This implementation works for only two strings
Input format is followed as given in the assignment. But, k is limited to 2
Sample input:
4
A, C, T, G
2
ACTGTGA
TACTGC
3
0 2 2 2 1
2 0 2 2 1
2 2 0 2 1
2 2 2 0 1
1 1 1 1 0