Skip to content

Shows the min edits you need to change one string into another and the longest similar subsequence between two strings (CS 325 2021)

Notifications You must be signed in to change notification settings

ajpert/edit-distance-and-longest-subsequence

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 

Repository files navigation

edit-distance-and-longest-subsequence

Shows the min edits you need to change one string into another and the longest similar subsequence between two strings (CS 325 2021)
please compile with c++ 11 g++ -std=c++11 your_file.cpp -o your_program
When running, please give two text files with strings in the command line, ie. ./run text1.txt text2.txt
The program will automatically get rid of any charaters other than the alphabet.
This program uses tabulation to find the min edits needed to change one string to another, and the longest similar subsequence between two string
The two files given are the original coivd genome and the delta variant, to show its simularity (these will take a while to run)


the output is as followed: (edit distance) (similar subsequence length)

About

Shows the min edits you need to change one string into another and the longest similar subsequence between two strings (CS 325 2021)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published