Expand description
§Example
use cs::longest_common_substring;
let lcs = longest_common_substring(&[
"ZYABCAGB",
"BCAGDTZYY",
"DACAGZZYSC",
"CAGYZYSAU",
"CAZYUCAGF",
]);
assert_eq!(lcs, "CAG");
Functions§
- common_
substrings - compute a vector of common substring among a slice of input substrings. The output is sorted lexicographically.
- longest_
common_ substring - Compute the longest common substring among a slice of strings