[][src]Crate cs

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