gbwt 0.3.0

Partial reimplementation of the GBWT.
Documentation 
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280

use super::*;

use crate::Orientation;
use rand::Rng;
use simple_sds::serialize;

//use simple_sds::serialize;

//-----------------------------------------------------------------------------

#[test]
fn empty_lcs() {
    let a: Vec<usize> = Vec::new();
    let b: Vec<usize> = Vec::new();
    assert!(lcs(&a, &b).is_empty(), "Non-empty LCS for empty inputs");

    let non_empty: Vec<usize> = vec![1, 2, 3];
    assert!(lcs(&a, &non_empty).is_empty(), "Non-empty LCS for empty first input");
    assert!(lcs(&non_empty, &b).is_empty(), "Non-empty LCS for empty second input");
}

#[test]
fn first_last_lcs() {
    let a: Vec<usize> = vec![1, 2, 3, 4, 5];

    let no_no: Vec<usize> = vec![6, 2, 4, 7];
    let no_no_left: Vec<(usize, usize)> = vec![(1, 1), (2, 3)];
    assert_eq!(lcs(&no_no, &a), no_no_left, "Incorrect LCS for no first / no last / left");
    let no_no_right: Vec<(usize, usize)> = vec![(1, 1), (3, 2)];
    assert_eq!(lcs(&a, &no_no), no_no_right, "Incorrect LCS for no first / no last / right");

    let no_yes: Vec<usize> = vec![6, 2, 4, 5];
    let no_yes_left: Vec<(usize, usize)> = vec![(1, 1), (2, 3), (3, 4)];
    assert_eq!(lcs(&no_yes, &a), no_yes_left, "Incorrect LCS for no first / yes last / left");
    let no_yes_right: Vec<(usize, usize)> = vec![(1, 1), (3, 2), (4, 3)];
    assert_eq!(lcs(&a, &no_yes), no_yes_right, "Incorrect LCS for no first / yes last / right");

    let yes_no: Vec<usize> = vec![1, 2, 4, 7];
    let yes_no_left: Vec<(usize, usize)> = vec![(0, 0), (1, 1), (2, 3)];
    assert_eq!(lcs(&yes_no, &a), yes_no_left, "Incorrect LCS for yes first / no last / left");
    let yes_no_right: Vec<(usize, usize)> = vec![(0, 0), (1, 1), (3, 2)];
    assert_eq!(lcs(&a, &yes_no), yes_no_right, "Incorrect LCS for yes first / no last / right");

    let yes_yes: Vec<usize> = vec![1, 2, 4, 5];
    let yes_yes_left: Vec<(usize, usize)> = vec![(0, 0), (1, 1), (2, 3), (3, 4)];
    assert_eq!(lcs(&yes_yes, &a), yes_yes_left, "Incorrect LCS for yes first / yes last / left");
    let yes_yes_right: Vec<(usize, usize)> = vec![(0, 0), (1, 1), (3, 2), (4, 3)];
    assert_eq!(lcs(&a, &yes_yes), yes_yes_right, "Incorrect LCS for yes first / yes last / right");
}

#[test]
fn minimal_maximal_lcs() {
    let four_odd: Vec<usize> = vec![1, 3, 5, 7];
    let five_odd: Vec<usize> = vec![1, 3, 5, 7, 9];
    let four_even: Vec<usize> = vec![4, 6, 8, 10];
    let five_even: Vec<usize> = vec![2, 4, 6, 8, 10];

    assert!(lcs(&four_odd, &four_even).is_empty(), "Non-empty LCS for disjoint inputs");

    let four_four: Vec<(usize, usize)> = vec![(0, 0), (1, 1), (2, 2), (3, 3)];
    assert_eq!(lcs(&four_odd, &four_odd), four_four, "Incorrect LCS for equal inputs");

    let prefix: Vec<(usize, usize)> = vec![(0, 0), (1, 1), (2, 2), (3, 3)];
    assert_eq!(lcs(&four_odd, &five_odd), prefix, "Incorrect LCS for prefix / full");
    assert_eq!(lcs(&five_odd, &four_odd), prefix, "Incorrect LCS for full / prefix");

    let left_suffix: Vec<(usize, usize)> = vec![(0, 1), (1, 2), (2, 3), (3, 4)];
    assert_eq!(lcs(&four_even, &five_even), left_suffix, "Incorrect LCS for suffix / full");
    let right_suffix: Vec<(usize, usize)> = vec![(1, 0), (2, 1), (3, 2), (4, 3)];
    assert_eq!(lcs(&five_even, &four_even), right_suffix, "Incorrect LCS for full / suffix");
}

fn random_sequence(len: usize, sigma: usize) -> Vec<usize> {
    let mut rng = rand::thread_rng();
    (0..len).map(|_| rng.gen_range(0..sigma)).collect()
}

fn random_lcs_instance(len: usize, sigma: usize) {
    let left = random_sequence(len, sigma);
    let right = random_sequence(len, sigma);
    let result = lcs(&left, &right);

    for i in 0..result.len() {
        assert!(result[i].0 < left.len(), "Invalid left LCS position {} (len {}, sigma {})", i, len, sigma);
        assert!(result[i].1 < right.len(), "Invalid right LCS position {} (len {}, sigma {})", i, len, sigma);
        if i > 0 {
            assert!(result[i].0 > result[i - 1].0, "Non-increasing left LCS position {} (len {}, sigma {})", i, len, sigma);
            assert!(result[i].1 > result[i - 1].1, "Non-increasing right LCS position {} (len {}, sigma {})", i, len, sigma);
        }
        assert_eq!(left[result[i].0], right[result[i].1], "Incorrect LCS element {} (len {}, sigma {})", i, len, sigma);
    }
}

#[test]
fn random_lcs() {
    random_lcs_instance(10, 5);
    random_lcs_instance(100, 10);
    random_lcs_instance(300, 20);
}

//-----------------------------------------------------------------------------

fn extract_path(graph: &GBZ, path_id: usize, orientation: Orientation) -> Vec<usize> {
    graph.path(path_id, orientation)
        .unwrap()
        .map(|(id, o)| support::encode_node(id, o))
        .collect()
}

fn node_len(graph: &GBZ, handle: usize) -> usize {
    graph.sequence_len(support::node_id(handle)).unwrap_or(0)
}

fn path_len(graph: &GBZ, path: &[usize]) -> usize {
    path.iter().map(|handle| node_len(graph, *handle)).sum()
}

#[test]
fn empty_path_lcs() {
    let filename = support::get_test_data("translation.gbz");
    let graph: GBZ = serialize::load_from(&filename).unwrap();
    let empty: Vec<usize> = Vec::new();
    let path = extract_path(&graph, 0, Orientation::Forward);

    let truth = (Vec::new(), 0);
    assert_eq!(path_lcs(&empty, &empty, &graph), truth, "Non-empty LCS for empty inputs");
    assert_eq!(path_lcs(&empty, &path, &graph), truth, "Non-empty LCS for empty first input");
    assert_eq!(path_lcs(&path, &empty, &graph), truth, "Non-empty LCS for empty second input");

    let reverse = extract_path(&graph, 0, Orientation::Reverse);
    assert_eq!(path_lcs(&path, &reverse, &graph), truth, "Non-empty LCS for non-overlapping paths");
}

#[test]
fn identical_path_lcs() {
    let filename = support::get_test_data("translation.gbz");
    let graph: GBZ = serialize::load_from(&filename).unwrap();

    for path_id in 0..graph.paths() {
        for orientation in [Orientation::Forward, Orientation::Reverse] {
            let path = extract_path(&graph, path_id, orientation);
            let truth = path.iter().enumerate().map(|(i, _)| (i, i)).collect();
            let len = path_len(&graph, &path);
            assert_eq!(path_lcs(&path, &path, &graph), (truth, len), "Incorrect LCS for identical paths {} {}", path_id, orientation);
        }
    }
}

fn path_lcs_instance(graph: &GBZ, left_id: usize, right_id: usize, orientation: Orientation) {
    let left = extract_path(graph, left_id, orientation);
    let right = extract_path(graph, right_id, orientation);
    let (result, len) = path_lcs(&left, &right, graph);

    let mut total_len = 0;
    let test = format!("(paths {} and {} {})", left_id, right_id, orientation);
    for i in 0..result.len() {
        assert!(result[i].0 < left.len(), "Invalid left LCS position {} {}", i, test);
        assert!(result[i].1 < right.len(), "Invalid right LCS position {} {}", i, test);
        if i > 0 {
            assert!(result[i].0 > result[i - 1].0, "Non-increasing left LCS position {} {}", i, test);
            assert!(result[i].1 > result[i - 1].1, "Non-increasing right LCS position {} {}", i, test);
        }
        assert_eq!(left[result[i].0], right[result[i].1], "Incorrect LCS element {} {}", i, test);
        total_len += node_len(graph, left[result[i].0]);
    }
    assert_eq!(total_len, len, "Incorrect LCS length {}", test);
}

#[test]
fn real_path_lcs() {
    let filename = support::get_test_data("translation.gbz");
    let graph: GBZ = serialize::load_from(&filename).unwrap();

    for left_id in 0..graph.paths() {
        for right_id in 0..graph.paths() {
            for orientation in [Orientation::Forward, Orientation::Reverse] {
                path_lcs_instance(&graph, left_id, right_id, orientation);
            }
        }
    }
}

#[test]
fn path_lcs_weights() {
    let filename = support::get_test_data("translation.gbz");
    let graph: GBZ = serialize::load_from(&filename).unwrap();

    // This is an artificial scenario where the weights matter.
    // 1, 5, and 11 are weight 2 nodes and form the path LCS.
    // Normal LCS would return 1, 2, 3, 4.
    let left: Vec<usize> = vec![
        support::encode_node(1, Orientation::Forward),
        support::encode_node(2, Orientation::Forward),
        support::encode_node(3, Orientation::Forward),
        support::encode_node(4, Orientation::Forward),
        support::encode_node(5, Orientation::Forward),
        support::encode_node(11, Orientation::Forward),
    ];
    let right: Vec<usize> = vec![
        support::encode_node(1, Orientation::Forward),
        support::encode_node(5, Orientation::Forward),
        support::encode_node(11, Orientation::Forward),
        support::encode_node(2, Orientation::Forward),
        support::encode_node(3, Orientation::Forward),
        support::encode_node(4, Orientation::Forward),
    ];

    let unweighted_truth: Vec<(usize, usize)> = vec![(0, 0), (1, 3), (2, 4), (3, 5)];
    let path_truth: Vec<(usize, usize)> = vec![(0, 0), (4, 1), (5, 2)];
    let path_len = 6;

    assert_eq!(lcs(&left, &right), unweighted_truth, "Incorrect unweighted LCS");
    assert_eq!(path_lcs(&left, &right, &graph), (path_truth, path_len), "Incorrect path LCS");
}

//-----------------------------------------------------------------------------

fn fast_vs_naive_instance(len: usize, sigma: usize, max_weight: usize) {
    let weights: Vec<usize> = (0..sigma).map(|_| rand::thread_rng().gen_range(1..=max_weight)).collect();
    let weight = &|x: usize| -> usize { weights[x] };
    let left = random_sequence(len, sigma);
    let right = random_sequence(len, sigma);
    let fast = fast_weighted_lcs(&left, &right, weight);
    let naive = naive_weighted_lcs(&left, &right, weight);

    // Check the results. The two algorithms may find different subsequences with the same total weight.
    let test = format!("(len {}, sigma {}, max weight {})", len, sigma, max_weight);
    assert_eq!(fast.1, naive.1, "Total weights differ for {}", test);
    let mut fast_weight = 0;
    for (i, (a_offset, b_offset)) in fast.0.iter().copied().enumerate() {
        assert_eq!(left[a_offset], right[b_offset], "Incorrect LCS element {} with the fast algorithm for {}", i, test);
        fast_weight += weight(left[a_offset]);
    }
    assert_eq!(fast_weight, fast.1, "Incorrect total weight with the fast algorithm for {}", test);
    let mut naive_weight = 0;
    for (i, (a_offset, b_offset)) in naive.0.iter().copied().enumerate() {
        assert_eq!(left[a_offset], right[b_offset], "Incorrect LCS element {} with the naive algorithm for {}", i, test);
        naive_weight += weight(left[a_offset]);
    }
    assert_eq!(naive_weight, naive.1, "Incorrect total weight with the naive algorithm for {}", test);
}

#[test]
fn fast_vs_naive_lcs() {
    fast_vs_naive_instance(10, 5, 10);
    fast_vs_naive_instance(30, 10, 15);
    fast_vs_naive_instance(100, 15, 20);
}

fn similar_sequences(len: usize, sigma: usize, max_weight: usize, mutation_rate: f64) {
    let weights: Vec<usize> = (0..sigma).map(|_| rand::thread_rng().gen_range(1..=max_weight)).collect();
    let weight = &|x: usize| -> usize { weights[x] };
    let left = random_sequence(len, sigma);
    let mut right = left.clone();
    let mut rng = rand::thread_rng();
    for i in 0..len {
        if rng.gen_bool(mutation_rate) {
            right[i] = rng.gen_range(0..sigma);
        }
    }
    let result = fast_weighted_lcs(&left, &right, weight);

    // Check the results. The two algorithms may find different subsequences with the same total weight.
    let test = format!("(len {}, sigma {}, max weight {}, mutation rate {})", len, sigma, max_weight, mutation_rate);
    let mut total_weight = 0;
    for (i, (a_offset, b_offset)) in result.0.iter().copied().enumerate() {
        assert_eq!(left[a_offset], right[b_offset], "Incorrect LCS element {} for {}", i, test);
        total_weight += weight(left[a_offset]);
    }
    assert_eq!(total_weight, result.1, "Incorrect total weight for {}", test);
}

#[test]
fn similar_sequences_lcs() {
    similar_sequences(100, 5, 10, 0.02);
    similar_sequences(1000, 10, 15, 0.01);
    similar_sequences(10000, 15, 20, 0.005);
}

//-----------------------------------------------------------------------------