Commit 1a27c6c

authored

feat: add Smith-Waterman algorithm for local sequence alignment (TheAlgorithms#960)

1 parent 700fd3a commit 1a27c6cCopy full SHA for 1a27c6c

File tree

+431

-1

lines changed

+431

-1

lines changed

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -103,10 +103,11 @@`
`103`	`103`	`* [Minimum Cost Path](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/minimum_cost_path.rs)`
`104`	`104`	`* [Optimal Bst](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/optimal_bst.rs)`
`105`	`105`	`* [Rod Cutting](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/rod_cutting.rs)`
	`106`	`+ * [Smith-Waterman](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/smith_waterman.rs)`
`106`	`107`	`* [Snail](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/snail.rs)`
`107`	`108`	`* [Subset Generation](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/subset_generation.rs)`
`108`		`- * [Task Assignment](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/task_assignment.rs)`
`109`	`109`	`* [Subset Sum](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/subset_sum.rs)`
	`110`	`+ * [Task Assignment](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/task_assignment.rs)`
`110`	`111`	`* [Trapped Rainwater](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/trapped_rainwater.rs)`
`111`	`112`	`* [Word Break](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/word_break.rs)`
`112`	`113`	`* Financial`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,6 +14,7 @@ mod maximum_subarray;`
`14`	`14`	`mod minimum_cost_path;`
`15`	`15`	`mod optimal_bst;`
`16`	`16`	`mod rod_cutting;`
	`17`	`+mod smith_waterman;`
`17`	`18`	`mod snail;`
`18`	`19`	`mod subset_generation;`
`19`	`20`	`mod subset_sum;`
`@@ -45,6 +46,7 @@ pub use self::maximum_subarray::maximum_subarray;`
`45`	`46`	`pub use self::minimum_cost_path::minimum_cost_path;`
`46`	`47`	`pub use self::optimal_bst::optimal_search_tree;`
`47`	`48`	`pub use self::rod_cutting::rod_cut;`
	`49`	`+pub use self::smith_waterman::{score_function, smith_waterman, traceback};`
`48`	`50`	`pub use self::snail::snail;`
`49`	`51`	`pub use self::subset_generation::list_subset;`
`50`	`52`	`pub use self::subset_sum::is_sum_subset;`

Comments

(0)