A project realised for Elements of Bioinformatics subject.
The program computes an optimal matching of 2 DNA sequences based either on edit distance or similiarity.
The sequences and edit distance or similiarity criteria are given in .txt files in /data directory.
The edit distance and similiarity criteria are 5x5 matrices with row and column values corresponding to sequence letter change or indel ('_') in order shown below:
| A | C | G | T | - | |
|---|---|---|---|---|---|
| A | . | . | . | . | . |
| C | . | . | . | . | . |
| G | . | . | . | . | . |
| T | . | . | . | . | . |
| - | . | . | . | . | . |
It is also possible to translate given DNA sequence to RNA sequence or aminoacid sequence.