1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
//! Longest Common Subsequence
use ;
/// This `struct` is used to access the Longest Common Subsequence algorithm, as
/// implemented by the [rapidfuzz](https://crates.io/crates/rapidfuzz) crate, in
/// a generic manner.
///
/// The Longest Common Subsequence (LCS) measures the similarity between two
/// sequences by identifying the longest sequence of elements (characters,
/// numbers, etc.) that are common to both sequences. Importantly, the elements
/// in the common subsequence do not need to appear consecutively in the
/// original sequences.
///
/// It’s useful in applications where the order of elements is significant, but
/// their exact positions may vary. Common use cases involve:
///
/// * **Bioinformatics**: Commonly used in Bioinformatics for comparing genetic
/// sequences where identifying shared genes or regions, even if not
/// contiguous, is important.
///
/// * **Version Control Systems**: Tracking changes between different versions
/// of a document or codebase.
///
/// * **Plagiarism Detection**: Identifying similarities between texts even when
/// the wording is rearranged or some content is added or removed.
;
/// This `BatchComparator` trait implementation is used to access the
/// Longest Common Subsequence algorithm, as implemented by the
/// [rapidfuzz](https://crates.io/crates/rapidfuzz) crate, in a generic manner.
// impl