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
use std::borrow::Borrow;
use std::cmp::min;
use std::iter;
use std::iter::repeat;
use crate::utils::TextSlice;
pub fn unit_cost(a: u8, b: u8) -> u32 {
(a != b) as u32
}
#[allow(non_snake_case)]
pub struct Ukkonen<F>
where
F: Fn(u8, u8) -> u32,
{
D: [Vec<usize>; 2],
cost: F,
}
impl<F> Ukkonen<F>
where
F: Fn(u8, u8) -> u32,
{
pub fn with_capacity(m: usize, cost: F) -> Self {
let get_vec = || Vec::with_capacity(m + 1);
Ukkonen {
D: [get_vec(), get_vec()],
cost,
}
}
pub fn find_all_end<'a, C, T>(
&'a mut self,
pattern: TextSlice<'a>,
text: T,
k: usize,
) -> Matches<'_, F, C, T::IntoIter>
where
C: Borrow<u8>,
T: IntoIterator<Item = C>,
{
let m = pattern.len();
self.D[0].clear();
self.D[0].extend(repeat(k + 1).take(m + 1));
self.D[1].clear();
self.D[1].extend(0..=m);
Matches {
ukkonen: self,
pattern,
text: text.into_iter().enumerate(),
lastk: min(k, m),
m,
k,
}
}
}
pub struct Matches<'a, F, C, T>
where
F: Fn(u8, u8) -> u32,
C: Borrow<u8>,
T: Iterator<Item = C>,
{
ukkonen: &'a mut Ukkonen<F>,
pattern: TextSlice<'a>,
text: iter::Enumerate<T>,
lastk: usize,
m: usize,
k: usize,
}
impl<'a, F, C, T> Iterator for Matches<'a, F, C, T>
where
F: 'a + Fn(u8, u8) -> u32,
C: Borrow<u8>,
T: Iterator<Item = C>,
{
type Item = (usize, usize);
fn next(&mut self) -> Option<(usize, usize)> {
let cost = &self.ukkonen.cost;
for (i, c) in &mut self.text {
let col = i % 2;
let prev = 1 - col;
self.ukkonen.D[col][0] = 0;
self.lastk = min(self.lastk + 1, self.m);
for j in 1..=self.lastk {
self.ukkonen.D[col][j] = min(
min(self.ukkonen.D[prev][j] + 1, self.ukkonen.D[col][j - 1] + 1),
self.ukkonen.D[prev][j - 1] + (cost)(self.pattern[j - 1], *c.borrow()) as usize,
);
}
while self.ukkonen.D[col][self.lastk] > self.k {
self.lastk -= 1;
}
if self.lastk == self.m {
return Some((i, self.ukkonen.D[col][self.m]));
}
}
None
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_find_all_end() {
let mut ukkonen = Ukkonen::with_capacity(10, unit_cost);
let text = b"ACCGTGGATGAGCGCCATAG";
let pattern = b"TGAGCGT";
let occ: Vec<(usize, usize)> = ukkonen.find_all_end(pattern, text, 1).collect();
assert_eq!(occ, [(13, 1), (14, 1)]);
}
#[test]
fn test_find_start() {
let mut u = Ukkonen::with_capacity(10, unit_cost);
let pattern = b"ACCGT";
let text1 = b"ACCGTGGATGAGCGCCATAG";
let text2 = b"AACCGTGGATGAGCGCCATAG";
let occ: Vec<(usize, usize)> = u.find_all_end(pattern, text1, 1).collect();
assert_eq!(occ, [(3, 1), (4, 0), (5, 1)]);
let occ: Vec<(usize, usize)> = u.find_all_end(pattern, text2, 1).collect();
assert_eq!(occ, [(4, 1), (5, 0), (6, 1)]);
}
}