Skip to content
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.

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

Addition of multiple_longest_common_subsequence #861

Open
wants to merge 7 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
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
1 change: 1 addition & 0 deletions DIRECTORY.md
Original file line number Diff line number Diff line change
Expand Up @@ -329,6 +329,7 @@
* [Levenshtein Distance](https://github.com/TheAlgorithms/Rust/blob/master/src/string/levenshtein_distance.rs)
* [Lipogram](https://github.com/TheAlgorithms/Rust/blob/master/src/string/lipogram.rs)
* [Manacher](https://github.com/TheAlgorithms/Rust/blob/master/src/string/manacher.rs)
* [Multiple Longest Common Subsequence](https://github.com/TheAlgorithms/Rust/blob/master/src/string/multiple_longest_common_subsequence.rs)
* [Palindrome](https://github.com/TheAlgorithms/Rust/blob/master/src/string/palindrome.rs)
* [Pangram](https://github.com/TheAlgorithms/Rust/blob/master/src/string/pangram.rs)
* [Rabin Karp](https://github.com/TheAlgorithms/Rust/blob/master/src/string/rabin_karp.rs)
Expand Down
2 changes: 2 additions & 0 deletions src/string/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -36,6 +36,8 @@ __Properties__

[manacher-wiki]: https://en.wikipedia.org/wiki/Longest_palindromic_substring#Manacher's_algorithm

### [Multiple longest common subsequence](./multiple_longest_common_subsequence.rs)
From [A research paper](https://github.com/epita-rs/MLCS/blob/main/paper.pdf): A fast Heuristic Search Algorithm for finding the longest common subsequence among multiple strings.

### [Rabin Karp](./rabin_karp.rs)
From [Wikipedia][rabin-karp-wiki]: a string-searching algorithm created by Richard M. Karp and Michael O. Rabin that uses hashing
Expand Down
2 changes: 2 additions & 0 deletions src/string/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -12,6 +12,7 @@ mod knuth_morris_pratt;
mod levenshtein_distance;
mod lipogram;
mod manacher;
mod multiple_longest_common_subsequence;
mod palindrome;
mod pangram;
mod rabin_karp;
Expand Down Expand Up @@ -39,6 +40,7 @@ pub use self::knuth_morris_pratt::knuth_morris_pratt;
pub use self::levenshtein_distance::{naive_levenshtein_distance, optimized_levenshtein_distance};
pub use self::lipogram::is_lipogram;
pub use self::manacher::manacher;
pub use self::multiple_longest_common_subsequence::multiple_longest_common_subsequence;
pub use self::palindrome::is_palindrome;
pub use self::pangram::is_pangram;
pub use self::pangram::PangramStatus;
Expand Down
Loading
Loading