- Suppose that we have two sequences of DNA and we want to know how much they are similar.
- This program returns the similiraty between two DNA sequences in terms of Longest Common Subsequence and the Levensthein distance between the two DNA sequences; which can be interpreted as the number of operations which requires to pass from the one to the other one.
-
Notifications
You must be signed in to change notification settings - Fork 0
Longest Common Subsquence, Levenshtein distance, DNA similarity testing
License
azavana/DNA_Similarity_Testing
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Longest Common Subsquence, Levenshtein distance, DNA similarity testing
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published