Cycle matching for distributed topological bootstrapping

Cycle matching for distributed topological bootstrapping

Releave v1.0.0-beta is the public (and pre-publication) pre-release of this repository set to solicit/encourage feedback, raised issues, and pull requests from potential users. This repository is a fork of Song and Garcia-Redondo's interval-matching repo that has been streamlined/tailored to cycle-matching in the bootstrapping case for large-scale distributed computations.

Fork contributions

Fork contributes new functionality and makes significant changes to the code structure:

Functionality

• generalized to accept arbitrary (pre-computed) distance metrics
• additional utilities for cycle registration over data bootstraps
• integration of cycle matching with statistical permutation testing
• new modules for computation of Wasserstein variants
• new visualizations of aggregated statistcs and distributions of bootstrapped cycles
• new toy examples (and corresponding manipulations) for validation and exploration

Structure

• split cycle-matching implementation into modular structure
• re-factored into Pythonic functional programming style
• optimized for integration with high-performance computing (HPC) environment