chfi / rs-gfa
GFA parser in Rust
☆29Updated last year
Related projects ⓘ
Alternatives and complementary repositories for rs-gfa
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Updated last year
- Rust implementation of VG handle graph☆18Updated 11 months ago
- ntHash implementation in Rust☆34Updated 4 months ago
- A bit-packed k-mer representation (and relevant utilities) for rust☆47Updated 4 months ago
- Compacted and colored de Bruijn graph construction and querying☆76Updated this week
- GBWT in Rust☆42Updated this week
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Benchmarking pairwise aligners☆36Updated 7 months ago
- Rust bindings to minimap2 library☆66Updated 3 months ago
- Iterate over minimizers of a DNA sequence☆26Updated 4 months ago
- Rust bindings to the wavefront algorithm C implementation☆18Updated 2 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- Optimal sequence-to-graph alignment with recombinations☆24Updated last week
- A Rust library providing fully dynamic sets of k-mers with high locality☆44Updated last month
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆22Updated 2 weeks ago
- linearize and simplify variation graphs using blocked partial order alignment☆56Updated this week
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆44Updated this week
- genome variation graphs constructed from HLA GRCh38 ALTs☆22Updated 2 years ago
- ☆17Updated last year
- ☆15Updated 3 years ago
- Generate random test data for bioinformatics☆25Updated 5 months ago
- Fast and exact gap-affine partial order alignment☆40Updated 2 weeks ago
- Bioinformatics 101 tool for counting unique k-length substrings in DNA☆30Updated last year
- Space-efficient pseudoalignment with a colored de Bruijn graph☆50Updated 2 months ago
- GFA insert into GenomicSQLite☆48Updated 3 years ago
- GBWT-based handle graph☆30Updated 2 weeks ago
- Wavefront alignment algorithm (WFA) in Golang☆30Updated 3 weeks ago
- GFAffix identifies walk-preserving shared affixes in variation graphs and collapses them into a non-redundant graph structure.☆34Updated 9 months ago
- ☆28Updated last year
- ☆57Updated 2 weeks ago