In computer science, the Method of Four Russians is a technique for speeding up algorithms involving Boolean matrices, or more generally algorithms involving matrices in which each cell may take on only a bounded number of possible values.
Calculating edit distance between two strings and recovering a sequence of edit operations that achieves this minimal edit distance, execution time of those operation depends greatly on strings lengths.
Implemented solution applies Four Russians method to speed up execution of mentioned operations.
- Four Russians method is applied to speed up execution of calculating minimal edit distance
- Version 1.0
- Download repository to your local machine
- Position yourself in bioinformatika4Russians folder (use: cd with terminal)
- Position yourself in source folder (use: cd source)
- Run make in your terminal
- To execute program run ./p1 inputFile outputFile format tValue
- For details about passed arguments run ./p1 -help or ./p1 --help
- To run test execute ./p1 inputFile outputFile format tValue and pass location of test (/tests) file as inputFile
- Authors:Domagoj Magaš, Nino Uzelac and Marko Sertić
- Project made as part of Bionformatics course at Faculty of Electrical Engineering
- Link to course: https://www.fer.unizg.hr/predmet/bio