#constant-time #dna #hamming #distance #calculations #u64 #encoding

basebits

A library for encoding DNA into u64 to allow for constant time hamming distance calculations

6 releases (stable)

1.2.0 Nov 6, 2019
1.1.0 Nov 4, 2019
1.0.1 Nov 4, 2019
0.2.1 Aug 12, 2019
0.2.0 Aug 12, 2019

#16 in #hamming

Download history 54/week @ 2024-11-16 25/week @ 2024-11-23 14/week @ 2024-11-30 23/week @ 2024-12-07 15/week @ 2024-12-14 1/week @ 2024-12-21 27/week @ 2024-12-28 41/week @ 2025-01-04 37/week @ 2025-01-11 21/week @ 2025-01-18 20/week @ 2025-01-25 79/week @ 2025-02-01 48/week @ 2025-02-08 20/week @ 2025-02-15 32/week @ 2025-02-22 69/week @ 2025-03-01

182 downloads per month
Used in rumi

MIT license

17KB
396 lines

docs crates.io

basebits

A library for memory efficient short DNA sequence encoding.

Synopsis

When to use this library? If you are comparing strings against each other more than 4 times, it becomes more efficient to pay the cost of encoding them.

Operations

Constant time hamming distance calculations.

Example

use basebits::{BaseBits, hamming_dist};

fn main() {
    let string1 = b"ACTGACTG";
    let string2 = b"ACTTACTG";

    let string1 = BaseBits::new(string1).unwrap();
    let string2 = BaseBits::new(string2).unwrap();

    assert_eq!(hamming_dist(&string1, &string2), 1);
}

Reference

See 'Constant Time Hamming Distance' section: https://www.biorxiv.org/content/10.1101/648683v1.full

Future directions

FFT stuff?

No runtime deps