Addition of multiple_longest_common_subsequence

[Gaspardcode]

Description

To whom it may concern,

this pull request aims at introducing an algorithm to find the longest common subsequence among multiple sequences.

Finding a solution other than brute force is not really intuitive. I advise to look at the first comments of this thread.

The pull request implements a method based on heuristic, as described in the following research paper.

Thank you for considering this work.

Type of change

• New feature (non-breaking change which adds functionality)

Checklist:

• I ran bellow commands using the latest version of rust nightly.
• I ran cargo clippy --all -- -D warnings just before my last commit and fixed any issue that was found.
  Note: I mean I did only delete the issues related to my pull request
• I ran cargo fmt just before my last commit.
• I ran cargo test just before my last commit and all tests passed.
• I added my algorithm to the corresponding mod.rs file within its own folder, and in any parent folder(s).
• I added my algorithm to DIRECTORY.md with the correct link.
• I checked COUNTRIBUTING.md and my code follows its guidelines.

[codecov-commenter]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 95.53%. Comparing base (d4c3126) to head (c1171c9).

Additional details and impacted files

@@            Coverage Diff             @@
##           master     #861      +/-   ##
==========================================
+ Coverage   95.49%   95.53%   +0.04%     
==========================================
  Files         316      317       +1     
  Lines       22922    23142     +220     
==========================================
+ Hits        21889    22109     +220     
  Misses       1033     1033              

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.