fastars 0.1.0

Ultra-fast QC and trimming for short and long reads
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
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
//! Long-read specific trimming.
//!
//! This module provides trimming algorithms optimized for
//! long reads (PacBio, Oxford Nanopore), including:
//! - Splitting chimeric reads at internal adapters
//! - Splitting reads at low-quality regions

use super::TrimResult;

/// Configuration for long-read trimming.
#[derive(Debug, Clone)]
pub struct LongReadConfig {
    /// Adapter sequence to split on.
    pub adapter: Option<Vec<u8>>,
    /// Maximum mismatches for adapter detection.
    pub max_mismatch: usize,
    /// Minimum segment length after splitting.
    pub min_segment_length: usize,
    /// Quality threshold for low-quality region detection.
    pub quality_threshold: u8,
    /// Minimum low-quality region length to trigger split.
    pub min_low_quality_length: usize,
}

impl Default for LongReadConfig {
    fn default() -> Self {
        Self {
            adapter: None,
            max_mismatch: 3,
            min_segment_length: 200,
            quality_threshold: 7,
            min_low_quality_length: 50,
        }
    }
}

impl LongReadConfig {
    /// Create a new long-read config with default settings.
    pub fn new() -> Self {
        Self::default()
    }

    /// Set adapter sequence for splitting.
    pub fn with_adapter(mut self, adapter: Vec<u8>) -> Self {
        self.adapter = Some(adapter);
        self
    }

    /// Set maximum mismatches.
    pub fn with_max_mismatch(mut self, max: usize) -> Self {
        self.max_mismatch = max;
        self
    }

    /// Set minimum segment length.
    pub fn with_min_segment_length(mut self, length: usize) -> Self {
        self.min_segment_length = length;
        self
    }

    /// Set quality threshold.
    pub fn with_quality_threshold(mut self, threshold: u8) -> Self {
        self.quality_threshold = threshold;
        self
    }

    /// Set minimum low-quality region length.
    pub fn with_min_low_quality_length(mut self, length: usize) -> Self {
        self.min_low_quality_length = length;
        self
    }
}

/// Split a long read at internal adapter positions.
///
/// Chimeric reads can contain internal adapter sequences where
/// different molecules were ligated together. This function
/// finds these positions and returns segments.
///
/// # Arguments
/// * `seq` - The read sequence
/// * `qual` - Quality scores (unused but kept for API consistency)
/// * `adapter` - The adapter sequence to find
///
/// # Returns
/// Vector of TrimResult representing each segment.
pub fn split_on_adapter(seq: &[u8], _qual: &[u8], adapter: &[u8]) -> Vec<TrimResult> {
    if seq.is_empty() || adapter.is_empty() {
        return vec![TrimResult::full(seq.len())];
    }

    let positions = find_all_adapter_positions(seq, adapter, 3);

    if positions.is_empty() {
        return vec![TrimResult::full(seq.len())];
    }

    let mut segments = Vec::new();
    let mut prev_end = 0;

    for pos in positions {
        if pos > prev_end {
            segments.push(TrimResult::new(prev_end, pos));
        }
        prev_end = pos + adapter.len();
    }

    // Add final segment
    if prev_end < seq.len() {
        segments.push(TrimResult::new(prev_end, seq.len()));
    }

    // Filter out segments that are too short
    segments.retain(|s| s.len() >= 200);

    if segments.is_empty() {
        // If all segments were filtered, return full read
        vec![TrimResult::full(seq.len())]
    } else {
        segments
    }
}

/// Split a long read at low-quality regions.
///
/// Long reads can have internal low-quality regions that may
/// represent sequencing errors. This function identifies these
/// regions and splits the read.
///
/// # Arguments
/// * `seq` - The read sequence (unused but kept for API consistency)
/// * `qual` - Quality scores (Phred+33 encoded)
/// * `threshold` - Phred score below which is considered low quality
/// * `min_length` - Minimum length of low-quality region to trigger split
///
/// # Returns
/// Vector of TrimResult representing each good-quality segment.
pub fn split_on_low_quality(
    seq: &[u8],
    qual: &[u8],
    threshold: u8,
    min_length: usize,
) -> Vec<TrimResult> {
    let len = qual.len().min(seq.len());
    if len == 0 {
        return vec![TrimResult::empty()];
    }

    // Find low-quality regions
    let low_qual_regions = find_low_quality_regions(qual, threshold, min_length);

    if low_qual_regions.is_empty() {
        return vec![TrimResult::full(len)];
    }

    let mut segments = Vec::new();
    let mut prev_end = 0;

    for (start, end) in low_qual_regions {
        if start > prev_end {
            segments.push(TrimResult::new(prev_end, start));
        }
        prev_end = end;
    }

    // Add final segment
    if prev_end < len {
        segments.push(TrimResult::new(prev_end, len));
    }

    // Filter out segments that are too short
    segments.retain(|s| s.len() >= 200);

    if segments.is_empty() {
        vec![TrimResult::full(len)]
    } else {
        segments
    }
}

/// Find all positions where adapter appears in sequence.
fn find_all_adapter_positions(seq: &[u8], adapter: &[u8], max_mismatch: usize) -> Vec<usize> {
    let mut positions = Vec::new();
    let seq_len = seq.len();
    let adapter_len = adapter.len();

    if seq_len < adapter_len {
        return positions;
    }

    for start in 0..=seq_len - adapter_len {
        let mut mismatches = 0;
        let mut matched = true;

        for i in 0..adapter_len {
            if seq[start + i] != adapter[i] {
                mismatches += 1;
                if mismatches > max_mismatch {
                    matched = false;
                    break;
                }
            }
        }

        if matched {
            positions.push(start);
        }
    }

    positions
}

/// Find regions where quality is below threshold.
fn find_low_quality_regions(qual: &[u8], threshold: u8, min_length: usize) -> Vec<(usize, usize)> {
    let mut regions = Vec::new();
    let len = qual.len();
    let threshold_ascii = threshold + 33; // Convert to Phred+33

    let mut in_low_qual = false;
    let mut region_start = 0;

    for (i, &q) in qual.iter().enumerate().take(len) {
        let is_low = q < threshold_ascii;

        if is_low && !in_low_qual {
            // Start of low-quality region
            in_low_qual = true;
            region_start = i;
        } else if !is_low && in_low_qual {
            // End of low-quality region
            in_low_qual = false;
            let region_len = i - region_start;
            if region_len >= min_length {
                regions.push((region_start, i));
            }
        }
    }

    // Handle region that extends to end
    if in_low_qual {
        let region_len = len - region_start;
        if region_len >= min_length {
            regions.push((region_start, len));
        }
    }

    regions
}

// Legacy type alias for compatibility
pub type LongReadTrimmer = LongReadConfig;

#[cfg(test)]
mod tests {
    use super::*;

    fn make_qual(scores: &[u8]) -> Vec<u8> {
        scores.iter().map(|&s| s + 33).collect()
    }

    #[test]
    fn test_long_read_config_default() {
        let config = LongReadConfig::default();
        assert!(config.adapter.is_none());
        assert_eq!(config.max_mismatch, 3);
        assert_eq!(config.min_segment_length, 200);
        assert_eq!(config.quality_threshold, 7);
    }

    #[test]
    fn test_split_on_adapter_no_adapter() {
        let seq = b"ACGTACGTACGT";
        let qual = make_qual(&[30; 12]);
        let segments = split_on_adapter(seq, &qual, b"NNNNNN");
        assert_eq!(segments.len(), 1);
        assert_eq!(segments[0], TrimResult::full(12));
    }

    #[test]
    fn test_split_on_adapter_empty() {
        let segments = split_on_adapter(&[], &[], b"ACGT");
        assert_eq!(segments.len(), 1);
    }

    #[test]
    fn test_split_on_adapter_single() {
        // Create a sequence with a distinct adapter in the middle
        // Use ACGT alternating pattern that won't match homopolymer runs
        let adapter = b"ACGTACGTAC";
        let mut seq = Vec::new();
        seq.extend_from_slice(&[b'G'; 250]); // First segment (all G)
        seq.extend_from_slice(adapter);
        seq.extend_from_slice(&[b'T'; 250]); // Second segment (all T)

        let qual = make_qual(&vec![30; seq.len()]);
        let segments = split_on_adapter(&seq, &qual, adapter);

        // Should split into 2 segments around the adapter
        assert_eq!(segments.len(), 2);
        // Both segments should be >= 200bp (min_segment_length)
        assert!(segments[0].len() >= 200);
        assert!(segments[1].len() >= 200);
        // Total covered length should be close to original - adapter
        let total_len: usize = segments.iter().map(|s| s.len()).sum();
        assert!(total_len > 400); // At least most of the 500bp non-adapter portion
    }

    #[test]
    fn test_split_on_low_quality_no_low_regions() {
        let seq = b"ACGTACGTACGT";
        let qual = make_qual(&[30; 12]);
        let segments = split_on_low_quality(seq, &qual, 10, 5);
        assert_eq!(segments.len(), 1);
        assert_eq!(segments[0], TrimResult::full(12));
    }

    #[test]
    fn test_split_on_low_quality_empty() {
        let segments = split_on_low_quality(&[], &[], 10, 5);
        assert_eq!(segments.len(), 1);
        assert!(segments[0].is_empty());
    }

    #[test]
    fn test_split_on_low_quality_internal_region() {
        // Create quality scores: high (300bp), low (100bp), high (300bp)
        // Both good segments must be >= 200bp (min_segment_length)
        let mut qual_scores = vec![30u8; 700];
        for i in 300..400 {
            qual_scores[i] = 5; // Low quality region (100bp)
        }
        let qual = make_qual(&qual_scores);
        let seq = vec![b'A'; 700];

        let segments = split_on_low_quality(&seq, &qual, 10, 50);

        // Should have 2 segments: before and after low-quality region
        // Both segments are >= 200bp so should pass min_segment_length filter
        assert_eq!(segments.len(), 2);
    }

    #[test]
    fn test_split_on_low_quality_short_region_ignored() {
        // Low quality region too short
        let mut qual_scores = vec![30u8; 100];
        for i in 40..50 {
            qual_scores[i] = 5; // Only 10bp low quality
        }
        let qual = make_qual(&qual_scores);
        let seq = vec![b'A'; 100];

        let segments = split_on_low_quality(&seq, &qual, 10, 50);

        // Should not split because low-quality region is too short
        assert_eq!(segments.len(), 1);
    }

    #[test]
    fn test_find_all_adapter_positions_exact() {
        let seq = b"AAAGGGGAACCCGGGGT";
        let adapter = b"GGGG";
        let positions = find_all_adapter_positions(seq, adapter, 0);
        assert!(positions.contains(&3));
        assert!(positions.contains(&12));
    }

    #[test]
    fn test_find_all_adapter_positions_with_mismatch() {
        let seq = b"AAAGGGXAAA";
        let adapter = b"GGGG";
        let positions = find_all_adapter_positions(seq, adapter, 1);
        assert!(positions.contains(&3));
    }

    #[test]
    fn test_find_low_quality_regions() {
        let qual = make_qual(&[30, 30, 5, 5, 5, 5, 5, 30, 30]);
        let regions = find_low_quality_regions(&qual, 10, 3);
        assert_eq!(regions.len(), 1);
        assert_eq!(regions[0], (2, 7));
    }

    #[test]
    fn test_find_low_quality_regions_at_end() {
        let qual = make_qual(&[30, 30, 30, 5, 5, 5, 5, 5]);
        let regions = find_low_quality_regions(&qual, 10, 3);
        assert_eq!(regions.len(), 1);
        assert_eq!(regions[0], (3, 8));
    }

    #[test]
    fn test_find_low_quality_regions_at_start() {
        let qual = make_qual(&[5, 5, 5, 5, 5, 30, 30, 30]);
        let regions = find_low_quality_regions(&qual, 10, 3);
        assert_eq!(regions.len(), 1);
        assert_eq!(regions[0], (0, 5));
    }

    #[test]
    fn test_config_builder() {
        let config = LongReadConfig::new()
            .with_adapter(b"ACGT".to_vec())
            .with_max_mismatch(5)
            .with_min_segment_length(500)
            .with_quality_threshold(10)
            .with_min_low_quality_length(100);
        assert_eq!(config.adapter.as_deref(), Some(b"ACGT".as_slice()));
        assert_eq!(config.max_mismatch, 5);
        assert_eq!(config.min_segment_length, 500);
        assert_eq!(config.quality_threshold, 10);
        assert_eq!(config.min_low_quality_length, 100);
    }
}