Skip to content

Commit 1a27c6c

Browse files
feat: add Smith-Waterman algorithm for local sequence alignment (#960)
1 parent 700fd3a commit 1a27c6c

File tree

3 files changed

+431
-1
lines changed

3 files changed

+431
-1
lines changed

DIRECTORY.md

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -103,10 +103,11 @@
103103
* [Minimum Cost Path](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/minimum_cost_path.rs)
104104
* [Optimal Bst](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/optimal_bst.rs)
105105
* [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)
106107
* [Snail](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/snail.rs)
107108
* [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)
109109
* [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)
110111
* [Trapped Rainwater](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/trapped_rainwater.rs)
111112
* [Word Break](https://github.com/TheAlgorithms/Rust/blob/master/src/dynamic_programming/word_break.rs)
112113
* Financial

src/dynamic_programming/mod.rs

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -14,6 +14,7 @@ mod maximum_subarray;
1414
mod minimum_cost_path;
1515
mod optimal_bst;
1616
mod rod_cutting;
17+
mod smith_waterman;
1718
mod snail;
1819
mod subset_generation;
1920
mod subset_sum;
@@ -45,6 +46,7 @@ pub use self::maximum_subarray::maximum_subarray;
4546
pub use self::minimum_cost_path::minimum_cost_path;
4647
pub use self::optimal_bst::optimal_search_tree;
4748
pub use self::rod_cutting::rod_cut;
49+
pub use self::smith_waterman::{score_function, smith_waterman, traceback};
4850
pub use self::snail::snail;
4951
pub use self::subset_generation::list_subset;
5052
pub use self::subset_sum::is_sum_subset;

0 commit comments

Comments
 (0)