bascet 0.4.0

Bascet is a tool to preprocess single-cell data, handling barcode detection, trimming, QC, and managing the execution of custom tools for each cell
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


//inspiration
//https://github.com/sstadick/rumi/blob/master/src/lib.rs

//suggests a BK-tree https://en.wikipedia.org/wiki/BK-tree  (not in above code)


// use basebits::{hamming_dist_none, BaseBits};  interesting lib!
// https://github.com/sstadick/basebits
// same guy
// https://www.biorxiv.org/content/10.1101/648683v1.full
// constant time hamming distance
// at biorad https://github.com/sstadick  


// https://peerj.com/articles/8275/

// could use this also to scan for barcodes if errors are present

// there are several bk-tree implementations in rust:
// https://www.google.com/search?q=rust+bk-tree&oq=rust+bk-tree&gs_lcrp=EgZjaHJvbWUyBggAEEUYOTIJCAEQABgNGIAEMggIAhAAGA0YHjIICAMQABgNGB4yCggEEAAYCBgNGB4yCggFEAAYCBgNGB4yDQgGEAAYhgMYgAQYigUyDQgHEAAYhgMYgAQYigUyDQgIEAAYhgMYgAQYigXSAQgxOTkxajBqN6gCALACAA&sourceid=chrome&ie=UTF-8

// https://github.com/sstadick/rumi  -- can use. wants htslib Record; keep all the way to the end?


use std::collections::HashSet;


///////////////////////////////
/// Given a list of sequenced UMIs, figure out how many 
/// 
/// For now: dummy, assuming no errors in sequencing
pub fn dedup_umi(umis: &Vec<Vec<u8>>) -> usize {

    let mut unique_umi = HashSet::new();
    for umi in umis {
        unique_umi.insert(umi);
    }

    unique_umi.len()
}