chfi / rs-gfaLinks
GFA parser in Rust
☆31Updated 2 years ago
Alternatives and similar repositories for rs-gfa
Users that are interested in rs-gfa are comparing it to the libraries listed below
Sorting:
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Updated 2 years ago
- Iterate over minimizers of a DNA sequence☆31Updated last year
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 4 months ago
- Rust implementation of VG handle graph☆20Updated last year
- Rust bindings to the wavefront algorithm C implementation☆18Updated 2 years ago
- GBWT in Rust☆43Updated 5 months ago
- genome variation graphs constructed from HLA GRCh38 ALTs☆23Updated 3 years ago
- Benchmarking pairwise aligners☆36Updated 6 months ago
- Compacted and colored de Bruijn graph construction and querying☆84Updated this week
- A bit-packed k-mer representation (and relevant utilities) for rust☆48Updated last year
- ntHash implementation in Rust☆36Updated last year
- Fast and exact gap-affine partial order alignment☆54Updated last month
- Generate random test data for bioinformatics☆26Updated last year
- Bioinformatics 101 tool for counting unique k-length substrings in DNA☆31Updated last year
- Optimal sequence-to-graph alignment with recombinations☆36Updated last month
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆52Updated last week
- Efficient, parallel compression for terabyte-scale data☆48Updated 3 months ago
- Filter of Pairwise Alignement☆45Updated 3 years ago
- Wavefront alignment algorithm (WFA) in Golang☆30Updated last month
- Contains the description of a file format to store kmers and associated values☆33Updated 3 years ago
- A Rust library providing fully dynamic sets of k-mers with high locality☆45Updated 11 months ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆50Updated last year
- linearize and simplify variation graphs using blocked partial order alignment☆58Updated last month
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆37Updated 3 months ago
- A long read simulator based on badread idea☆23Updated 2 years ago
- convert variation graph alignments to coverage maps over nodes☆24Updated 2 months ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- GFA insert into GenomicSQLite☆49Updated 4 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago