cbsrs 0.1.0

A Circular Binary Segmentation algorithm
Documentation
  • Coverage
  • 80%
    8 out of 10 items documented1 out of 8 items with examples
  • Size
  • Source code size: 12.37 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 1.43 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Links
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • Euphrasiologist

cbsrs

The cbsrs crate implements the Circular Binary Segmentation algorithm (1) based on code from (2).

It exposes an extremely simple API, as a trait which operates only on Vec<usize>.

use cbsrs::CBS;

let steps: Vec<usize> = vec![1, 1, 1, 3, 3, 2, 1, 2, 3, 300, 310, 321, 310, 299];

let shuffles = 1000;
let p = 0.05;

let res = steps.cbs(shuffles, p).unwrap();

for (start, end) in res.iter() {
  println!("{start}-{end}");
}

This implementation omits the 'validation' algorithm seen in other implementations.

  1. Olshen, Adam B., et al. "Circular binary segmentation for the analysis of array‐based DNA copy number data." Biostatistics 5.4 (2004): 557-572.
  2. https://github.com/jeremy9959/cbs/blob/master/cbs.py