Implementation for the longest common subsequence between 2 strings. Plus a drawn matrix showing the steps to do so. Using Python. You will need a white blank image for the code to work properly.
-
Notifications
You must be signed in to change notification settings - Fork 0
MayarNour/LCS-Bioinformatics
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Implementation for the longest common subsequence between 2 strings. Plus a drawn matrix showing the steps to do so.Using Python
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published