Releases: HudsonAlpha/fmlrc2
Releases · HudsonAlpha/fmlrc2
fmlrc2 repository renaming - (very) minor release
WFA-like edit distance
- Adds two functions that compute edit distance in a WFA-like manner; by smaller benchmarks, these methods were faster than the standard grid-based approach
- In larger benchmark, this reduced compute time by 5-10%
- Results should be identical to v0.1.6
v0.1.6 - Custom edit distance scoring
- Performance improvement: adds two functions for computing the edit distance metrics
- Updated all benchmarks to M1 processor; v0.1.5 was retained for comparison on new processor
LTO and CI
- Added LTO to the release profile, which provides roughly a 7% run-time improvement in the benchmark
- Added continuous integration for any future modifications
Interleaved Bit Vectors
Primary change is in bit vector representation:
- Replaces the separate bit vectors used for storing bits and counting ranks with an interleave block format
- The results are identical to v0.1.3, but reduces the runtime by approximately 5-10% in tests due to co-location of memory
Optimizations and refactoring
This release is primarily to provide some optimizations and cleanup on the code used in fmlrc2
- includes a change to remove unnecessary logic fork from rank(...) calls in the index bit vectors
- includes some streamlining in string_util to reduce run-times
- removed unnecessary memory copies from Levenshtein tie-breaking algorithms in read_correction.rs
- various other minor optimizations and delinting / making clippy happy
- updates to the version of needletail and triple_accel
Fix for reading BWT
- Includes a minor fix for reading BWTs from disk
- Includes new error checking on reading BWTs from disk
Documentation update
Fixing some documentation that was missing or incorrect, functionality should be identical to v0.1.0.
Initial Version
Initial version of fmlrc2
- Available on crates.io
- Near identical results to
fmlrc
v1, less than half the run-time