diced 0.1.3

A Rust reimplementation of the MinCED algorithm for identifying CRISPRs in full or assembled genomes.
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

extern crate diced;
extern crate noodles_fasta;

fn main() -> std::io::Result<()> {
    let crispr_scanner = diced::ScannerBuilder::default()
        //.min_spacer_length(10)
        //.max_spacer_length(60)
        .clone();

    let path = std::env::args().skip(1).next().ok_or(std::io::Error::new(
        std::io::ErrorKind::InvalidInput,
        "Missing required path",
    ))?;
    let mut reader = std::fs::File::open(&path)
        .map(std::io::BufReader::new)
        .map(noodles_fasta::Reader::new)
        .unwrap();
    for result in reader.records() {
        let record = result.unwrap();

        let id = std::str::from_utf8(record.name()).unwrap();
        let seq = std::str::from_utf8(record.sequence().as_ref()).unwrap();

        for (i, crispr) in crispr_scanner.scan(seq).enumerate() {
            if i == 0 {
                println!("##gff-version 3");
            }
            println!(
                "{}\t{}\t{}\t{}\t{}\t{}\t.\t.\tID=CRISPR{};rpt_type=direct;rpt_family=CRISPR;rpt_unit_seq={}",
                id,
                "diced:0.1.0",
                "repeat_region",
                crispr.start() + 1,
                crispr.end(),
                crispr.len(),
                i + 1,
                crispr.repeats().nth(1).unwrap().as_ref(),
            );
        }
    }

    Ok(())
}