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
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
use std::{
    collections::HashMap,
    sync::{Arc, Mutex},
    thread,
    time::Instant,
};

use crate::{align_sbr_to_smc, mapping2record, read_info::ReadInfo, reporter::Reporter};
use crate::{params, SubreadsAndSmc};
use crossbeam::channel::Sender;
use minimap2::{Aligner, Built, Mapping};
use mm2::gskits::{
    gsbam::{
        bam_record_ext::BamRecordExt, plp_counts_from_records::compute_max_ins_of_each_ref_position,
    },
    utils::ScopedTimer,
};
use mm2::mapping_ext::MappingExt;
use rust_htslib::bam::{ext::BamRecordExtensions, Record};
use tracing;

use serde::Serialize;

#[derive(Debug, Default)]
struct Cs2RefAlnRes {
    identity: f32,
    mm: u32,
    ins: u32,
    homo_ins: u32,
    del: u32,
    homo_del: u32,
    ref_sub_seq: Option<String>,
}

impl Cs2RefAlnRes {
    fn new(hit: &Mapping, ref_seq: &str) -> Self {
        let target_start = if hit.target_start > 10 {
            hit.target_start - 10
        } else {
            0
        } as usize;

        let target_end = (hit.target_end + 10).min(ref_seq.len() as i32) as usize;
        let ref_sub_seq = Some(ref_seq[target_start..target_end].to_string());

        let identity = MappingExt(hit).identity();

        Self {
            identity: identity,
            mm: 0,
            ins: 0,
            homo_ins: 0,
            del: 0,
            homo_del: 0,
            ref_sub_seq: ref_sub_seq,
        }
    }
}

fn align_cs_to_ref(
    cs: &str,
    ref_aligner: &Aligner<Built>,
    ref_seq: &str,
    query_name: &str,
    ref_range: Option<&gskits::utils::Range<usize>>,
) -> Option<Cs2RefAlnRes> {
    let hits = ref_aligner
        .map(
            cs.as_bytes(),
            false,
            false,
            None,
            Some(&[67108864, 68719476736]), // 67108864 eqx, 68719476736 secondary
            None,
        )
        .unwrap();

    let ref_bytes = ref_seq.as_bytes();

    if let Some(ref_range) = ref_range {
        let mut has_error_in_ref_range = false;

        for hit in &hits {
            let read_info = ReadInfo::new_fa_record("cs".to_string(), cs.to_string());
            let mut target_idx = HashMap::new();
            target_idx.insert(hit.target_name.as_ref().unwrap().as_str(), (0, 0));
            let align_record =
                mapping2record::build_bam_record_from_mapping(hit, &read_info, &target_idx);

            let mut r_cursor = None;
            let query = BamRecordExt::new(&align_record).get_seq();
            let query_bytes = query.as_bytes();

            for [qpos, rpos] in align_record.aligned_pairs_full() {
                if rpos.is_some() {
                    r_cursor = rpos;
                }
                if r_cursor.is_none() {
                    continue;
                }

                let r_cursor_value = r_cursor.map(|v| v as usize).unwrap();
                if rpos.is_none() || qpos.is_none() {
                    if ref_range.within_range(r_cursor_value) {
                        has_error_in_ref_range = true;
                        break;
                    }
                }

                if let (Some(qpos_), Some(rpos_)) = (qpos, rpos) {
                    let qpos_ = qpos_ as usize;
                    let rpos_ = rpos_ as usize;
                    if ref_bytes[rpos_] != query_bytes[qpos_] {
                        if ref_range.within_range(r_cursor_value) {
                            has_error_in_ref_range = true;
                            break;
                        }
                    }
                }
            }
        }

        if !has_error_in_ref_range {
            tracing::info!(
                "no error in interested ref range: query_name:{} ",
                query_name,
            );

            return None;
        }
    }

    return if hits.len() == 1 {
        let hit = &hits[0];
        Some(Cs2RefAlnRes::new(hit, ref_seq))
    } else {
        let mut hits = hits;
        hits.sort_by_key(|hit| hit.query_start);

        let infos = hits
            .iter()
            .map(|hit| {
                format!(
                "qstart:{}, qend:{}, rstart:{}, rend:{}, primary:{}, supp:{}, rev:{:?}, score:{:?}, identity:{:.2}",
                hit.query_start,
                hit.query_end,
                hit.target_start,
                hit.target_end,
                hit.is_primary,
                hit.is_supplementary,
                hit.strand,
                hit.alignment.as_ref().unwrap().alignment_score,
                MappingExt(hit).identity()
            )
            })
            .collect::<Vec<String>>()
            .join("\n");

        tracing::info!(
            "align_cs_to_ref: query_name:{} \n{}\n------------------------------",
            query_name,
            infos
        );

        None
    };
}

#[derive(Debug, Serialize, Default)]
pub struct MsaResult {
    pub identity: f32,
    pub mm: u32,
    pub ins: u32,
    pub del: u32,
    pub msa_seqs: Vec<String>,
    pub names: Vec<String>,
    pub positions: Vec<i32>,
    pub low_q: Option<u8>,
    pub strands: Vec<String>,
}

impl MsaResult {
    pub fn extract_error_region(self) -> Self {
        assert!(self.names[2].starts_with("ref"), "{}", self.names[2]);

        let smc_aligned = self.msa_seqs[1].as_bytes();
        let ref_aligned = self.msa_seqs[2].as_bytes();

        let tot_len = smc_aligned.len();
        let mut regions = vec![];
        (0..tot_len).for_each(|pos| {
            if smc_aligned[pos] != ref_aligned[pos] {
                let start = if pos > 20 { pos - 20 } else { 0 };
                let end = (pos + 20).min(tot_len);
                regions.push((start, end));
            }
        });
        let regions = merge_intervals(regions);

        let mut region_positions = regions
            .iter()
            .flat_map(|&(s, e)| {
                self.positions[s..e]
                    .iter()
                    .copied()
                    .chain(vec![-1].into_iter())
            })
            .collect::<Vec<_>>();
        if let Some(last) = region_positions.last().copied() {
            if last == -1 {
                region_positions.pop();
            }
        }

        let new_msa_seqs = self
            .msa_seqs
            .iter()
            .map(|ori_str| {
                regions
                    .iter()
                    .map(|&(s, e)| ori_str[s..e].to_string())
                    .collect::<Vec<_>>()
                    .join("#")
            })
            .collect::<Vec<_>>();

        if !region_positions.is_empty() {
            assert!(region_positions.len() == new_msa_seqs[0].len());
        }

        Self {
            msa_seqs: new_msa_seqs,
            positions: region_positions,
            ..self
        }
    }

    pub fn extract_lowq_region(self) -> Self {
        assert!(self.names[2].starts_with("ref"), "{}", self.names[2]);

        let qual = self.msa_seqs[0]
            .as_bytes()
            .iter()
            .map(|&v| if v == '-' as u8 { 10 } else { v - '0' as u8 })
            .collect::<Vec<_>>();

        let tot_len = qual.len();
        let mut regions = vec![];
        (0..tot_len).for_each(|pos| {
            if qual[pos] < self.low_q.unwrap_or(10) {
                let start = if pos > 10 { pos - 10 } else { 0 };
                let end = (pos + 10).min(tot_len);
                regions.push((start, end));
            }
        });
        let regions = merge_intervals(regions);

        let mut region_positions = regions
            .iter()
            .flat_map(|&(s, e)| {
                self.positions[s..e]
                    .iter()
                    .copied()
                    .chain(vec![-1].into_iter())
            })
            .collect::<Vec<_>>();
        if let Some(last) = region_positions.last().copied() {
            if last == -1 {
                region_positions.pop();
            }
        }

        let new_msa_seqs = self
            .msa_seqs
            .iter()
            .map(|ori_str| {
                regions
                    .iter()
                    .map(|&(s, e)| ori_str[s..e].to_string())
                    .collect::<Vec<_>>()
                    .join("#")
            })
            .collect::<Vec<_>>();

        if !region_positions.is_empty() {
            assert!(region_positions.len() == new_msa_seqs[0].len());
        }

        Self {
            msa_seqs: new_msa_seqs,
            positions: region_positions,
            ..self
        }
    }
}

pub fn align_sbr_and_ref_to_cs_worker(
    recv: crossbeam::channel::Receiver<SubreadsAndSmc>,
    sender: Sender<MsaResult>,
    ref_aligner: &Aligner<Built>,
    ref_seq: &str,
    target_idx: &HashMap<String, (usize, usize)>,
    map_params: &params::MapParams,
    align_params: &params::AlignParams,
    oup_params: &params::OupParams,
    reporter: Arc<Mutex<Reporter>>,
    ref_range: Option<gskits::utils::Range<usize>>,
) {
    let mut scoped_timer = ScopedTimer::new();

    let mut max_time = 0;
    let mut max_time_qname = String::new();

    let mut inp_sbrs = 0;
    let mut out_sbrs = 0;
    let mut out_smc = 0;
    let mut fallback_num = 0;
    let mut fallback_rescued_num = 0;
    let mut channel_filter_by_no_align = 0;
    let mut channel_filter_by_cs2ref_align_fail = 0;

    for mut subreads_and_smc in recv {
        // tracing::info!("sbr_cnt:{}-{}", subreads_and_smc.smc.name, subreads_and_smc.subreads.len());
        let timer = scoped_timer.perform_timing();
        let start = Instant::now();

        let cs2ref_aln_res = align_cs_to_ref(
            &subreads_and_smc.smc.seq,
            ref_aligner,
            ref_seq,
            &subreads_and_smc.smc.name,
            ref_range.as_ref(),
        );
        if cs2ref_aln_res.is_none() {
            channel_filter_by_cs2ref_align_fail += 1;
            continue;
        }
        let mut cs2ref_aln_res = cs2ref_aln_res.unwrap();

        // if cs2ref_aln_res.identity >= 0.9999 {
        //     continue;
        // }

        let ref_read_info = crate::read_info::ReadInfo::new_fa_record(
            "ref/-1".to_string(),
            cs2ref_aln_res.ref_sub_seq.take().unwrap(),
        );
        subreads_and_smc.subreads.push(ref_read_info);
        subreads_and_smc.subreads.iter_mut().for_each(|read_info| {
            read_info.dw = None;
            read_info.ar = None;
            read_info.cr = None;
            read_info.nn = None;
        });

        inp_sbrs += subreads_and_smc.subreads.len();
        let (mut align_infos, no_hit_indices) = align_sbr_to_smc(
            &subreads_and_smc,
            (0..subreads_and_smc.subreads.len()).collect(),
            target_idx,
            map_params,
            align_params,
            oup_params,
            false,
        );

        fallback_num += no_hit_indices.len();
        if align_infos.len() < 20 && !no_hit_indices.is_empty() {
            tracing::warn!(
                "fallback: smc_name:{}, num_sbrs:{}, num_fallback_sbrs:{}",
                subreads_and_smc.smc.name,
                subreads_and_smc.subreads.len(),
                no_hit_indices.len(),
            );
            let (fallback_align_infos, _) = align_sbr_to_smc(
                &subreads_and_smc,
                no_hit_indices,
                target_idx,
                map_params,
                align_params,
                oup_params,
                true,
            );

            fallback_rescued_num += fallback_align_infos.len();

            align_infos.extend(fallback_align_infos);
        }

        let elapsed_secs = start.elapsed().as_secs();
        if elapsed_secs > max_time {
            max_time = elapsed_secs;
            max_time_qname = subreads_and_smc.smc.name.clone();
        }

        out_sbrs += align_infos.len();

        align_infos = align_infos.into_iter().take(20).collect();

        let align_res = build_msa_result_from_records(
            align_infos,
            &subreads_and_smc.smc.seq,
            &subreads_and_smc.smc.name,
            subreads_and_smc.smc.qual.as_deref(),
            None,
        );
        if align_res.is_none() {
            channel_filter_by_no_align += 1;
            continue;
        }
        let mut align_res = align_res.unwrap();
        align_res.identity = cs2ref_aln_res.identity;
        align_res = align_res.extract_error_region();

        timer.done_with_cnt(1);
        out_smc += 1;
        sender.send(align_res).unwrap();
    }

    let filter_by_alignment = inp_sbrs - out_sbrs;
    {
        let mut reporter_ = reporter.lock().unwrap();
        reporter_.sbr_reporter.filter_by_alignment += filter_by_alignment;
        reporter_.channel_reporter.out_num += out_smc;
        reporter_.channel_reporter.filter_by_no_align += channel_filter_by_no_align;
        reporter_.channel_reporter.filter_by_cs2ref_align_fail +=
            channel_filter_by_cs2ref_align_fail;
        reporter_.sbr_reporter.fallback_num += fallback_num;
        reporter_.sbr_reporter.fallback_resuced_num += fallback_rescued_num;
    }

    tracing::info!(
        "align_sbr_to_smc_worker-{:?}. speed:{:.4}/s. single_smc_max_time:{}secs, max_time_qname:{}",
        thread::current().id(),
        scoped_timer.speed(Some(1000_000_000)),
        max_time,
        max_time_qname
    );
}

pub fn build_msa_result_from_records(
    mut records: Vec<Record>,
    ref_seq: &str,
    ref_name: &str,
    qual: Option<&[u8]>,
    low_q: Option<u8>,
) -> Option<MsaResult> {
    if records.len() == 0 {
        return None;
    }
    let ref_seq = ref_seq.as_bytes();
    records.sort_by_key(|record| {
        BamRecordExt::new(record)
            .get_qname()
            .rsplit_once("/")
            .unwrap()
            .1
            .parse::<i32>()
            .unwrap()
    });

    let first_record = records.first().unwrap();
    let first_record = BamRecordExt::new(first_record);
    if !first_record.get_qname().starts_with("ref") {
        return None;
    }

    let strands = records
        .iter()
        .map(|record| {
            if record.is_reverse() {
                "rev".to_string()
            } else {
                "fwd".to_string()
            }
        })
        .collect::<Vec<String>>();

    let major_pos_ins = compute_max_ins_of_each_ref_position(&records, None, None, None);
    let mut major_pos_ins_vec = major_pos_ins
        .iter()
        .map(|(&k, &v)| (k as usize, v as usize))
        .collect::<Vec<_>>();
    major_pos_ins_vec.sort_by_key(|v| v.0);
    let tot_len = major_pos_ins_vec.iter().map(|v| v.1 + 1).sum::<usize>();

    let mut cursor = 0;
    let major_start_point = major_pos_ins_vec
        .iter()
        .map(|&(_, max_ins)| {
            let cur_point = cursor;
            cursor += max_ins + 1;
            cur_point
        })
        .collect::<Vec<_>>();

    let major_pos2major_starting_point = major_pos_ins_vec
        .iter()
        .map(|&(ma, _)| ma)
        .zip(major_start_point.into_iter())
        .collect::<HashMap<_, _>>();

    let mut major_positions = vec![-1; tot_len];
    major_pos_ins_vec.iter().for_each(|&(major, _)| {
        major_positions[*major_pos2major_starting_point.get(&major).unwrap()] = major as i32
    });
    (0..tot_len).for_each(|idx| {
        if idx > 0 && major_positions[idx] == -1 {
            major_positions[idx] = major_positions[idx - 1];
        }
    });

    let mut anchor_aligned = vec!['-' as u8; tot_len];
    major_pos_ins_vec.iter().for_each(|(major, _)| {
        anchor_aligned[*major_pos2major_starting_point.get(major).unwrap()] = ref_seq[*major];
    });
    let anchor_aligned = String::from_utf8(anchor_aligned).unwrap();

    let mut anchor_qual = vec!['-'; tot_len];
    if let Some(qual) = qual {
        major_pos_ins_vec.iter().for_each(|(major, _)| {
            anchor_qual[*major_pos2major_starting_point.get(major).unwrap()] =
                ((qual[*major] / 5u8).min(9) + '0' as u8) as char;
        });
    }
    let anchor_qual = anchor_qual.iter().collect::<String>();

    let msa = records
        .iter()
        .map(|record| {
            let mut aligned = vec!['-' as u8; tot_len];
            build_one_record_of_msa(record, &major_pos2major_starting_point, &mut aligned);
            String::from_utf8(aligned).unwrap()
        })
        .collect::<Vec<_>>();

    let mut msa_seqs = vec![anchor_qual, anchor_aligned];
    msa_seqs.extend(msa.into_iter());
    let mut names = vec!["qual".to_string(), ref_name.to_string()];
    names.extend(
        records
            .iter()
            .map(|record| BamRecordExt::new(record).get_qname()),
    );

    Some(MsaResult {
        identity: 0.0,
        mm: 0,
        ins: 0,
        del: 0,
        msa_seqs: msa_seqs,
        names: names,
        positions: major_positions,
        low_q: low_q,
        strands: strands,
    })
}

fn build_one_record_of_msa(
    record: &Record,
    major_pos2major_starting_point: &HashMap<usize, usize>,
    result: &mut Vec<u8>,
) {
    let record_ext = BamRecordExt::new(record);
    let ref_start = record_ext.reference_start() as i64;
    let ref_end = record_ext.reference_end() as i64;
    let q_start = record_ext.query_alignment_start() as i64;
    let q_end = record_ext.query_alignment_end() as i64;
    let query = record_ext.get_seq();
    let query = query.as_bytes();
    let mut q_pos_cursor = None;
    let mut r_pos_cursor = None;
    let mut delta = 0;
    for [qpos, rpos] in record.aligned_pairs_full() {
        if qpos.is_some() {
            q_pos_cursor = qpos;
        }
        if rpos.is_some() {
            r_pos_cursor = rpos;
        }

        if q_pos_cursor.is_none() || r_pos_cursor.is_none() {
            continue;
        }

        if q_pos_cursor.unwrap() < q_start || r_pos_cursor.unwrap() < ref_start {
            continue;
        }

        if q_pos_cursor.unwrap() >= q_end || r_pos_cursor.unwrap() >= ref_end {
            break;
        }

        if rpos.is_some() {
            delta = 0;
        } else {
            delta += 1;
        }
        let r_cursor = r_pos_cursor.map(|v| v as usize).unwrap();
        let r_cursor = &r_cursor;
        if !major_pos2major_starting_point.contains_key(r_cursor) {
            continue;
        }

        let base_pos = *major_pos2major_starting_point.get(r_cursor).unwrap();

        if let Some(qpos) = qpos.map(|v| v as usize) {
            result[base_pos + delta] = query[qpos];
        }
    }
}

fn merge_intervals(mut intervals: Vec<(usize, usize)>) -> Vec<(usize, usize)> {
    if intervals.is_empty() {
        return vec![];
    }
    intervals.sort_by_key(|item| item.0);

    let mut merged = Vec::new();
    let mut current = intervals[0].clone(); // 初始化为第一个区间

    for interval in intervals.into_iter().skip(1) {
        if interval.0 <= current.1 {
            // 如果当前区间的 start 小于等于上一个区间的 end,进行合并
            current.1 = current.1.max(interval.1); // 更新 end 为两者中的较大值
        } else {
            // 没有重叠,保存当前区间,更新 current 为新的区间
            merged.push(current);
            current = interval;
        }
    }

    // 最后将最后一个区间添加到 merged 中
    merged.push(current);

    merged
}

#[cfg(test)]
mod test {

    #[test]
    fn merge_intervals() {
        let intervals = vec![(0, 65), (64, 146), (145, 355)];
        println!("{:?}", super::merge_intervals(intervals));
    }
}