Skip to content

Edit_Distance algorithm for genetic string matching #10336

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 10 commits into from
Closed

Edit_Distance algorithm for genetic string matching #10336

Changes from 1 commit
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
f574ce1
Edit_Distance algorithm for genetic string matching
anshul-2010 Oct 12, 2023
caeda9f
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Oct 12, 2023
f3303b0
Update edit_distance.py
anshul-2010 Oct 12, 2023
a6ef5bd
Update edit_distance.py
anshul-2010 Oct 12, 2023
00da496
Update edit_distance.py
anshul-2010 Oct 12, 2023
4d1fd42
Update edit_distance.py
anshul-2010 Oct 12, 2023
1455e30
Update edit_distance.py
anshul-2010 Oct 12, 2023
c97c94a
Update edit_distance.py
anshul-2010 Oct 12, 2023
a5d5316
Update edit_distance.py
anshul-2010 Oct 12, 2023
4d64c3e
Update edit_distance.py
anshul-2010 Oct 12, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Update edit_distance.py
  • Loading branch information
@anshul-2010
anshul-2010 authored Oct 12, 2023
commit a5d5316fb7832efce0941e1250afe7f02dc54f16
2 changes: 1 addition & 1 deletion genetic_algorithm/edit_distance.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@ def edit_distance(source: str, target: str) -> int:
counting the minimum number of operations required to transform one string
into another.
In genetic algorithms consisting of A,T, G, and C nucleotides, this matching
becomes essential in understanding the mutation in succesive genes.
becomes essential in understanding the mutation in successive genes.
Hence, this algorithm comes in handy when we are trying to quantify the
mutations in successive generations.
Args:
Expand Down