CornellHPC / HySortK
High Performance Sorting Based Distributed memory K-mer counter
☆11Updated 7 months ago
Alternatives and similar repositories for HySortK:
Users that are interested in HySortK are comparing it to the libraries listed below
- LOGAN: High-Performance Multi-GPU X-Drop Long-Read Alignment.☆29Updated 2 years ago
- A versatile pairwise aligner for genomic and spliced nucleotide sequences☆18Updated last week
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆57Updated 8 months ago
- Scrooge is a high-performance pairwise sequence aligner based on the GenASM algorithm. Scrooge includes three novel algorithmic improveme…☆37Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- AirLift is a tool that updates mapped reads from one reference genome to another. Unlike existing tools, It accounts for regions not shar…☆27Updated 8 months ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆48Updated 2 years ago
- An Fast variant calling tool to detection germline and somatic variants☆10Updated last year
- Parallel String Graph Construction, Transitive Reduction, and Contig Generation for De Novo Genome Assembly☆15Updated 7 months ago
- Efficient, parallel compression for terabyte-scale data☆38Updated 2 weeks ago
- De Bruijn graph construction for large k.☆18Updated 3 years ago
- Efficient construction of the BWT using string compression☆17Updated 3 months ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 5 years ago
- Rust crate with bindings and interface to the SPOA library for generating consensus sequences.☆10Updated 5 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- ☆25Updated 3 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- C implementation of the Landau-Vishkin algorithm☆35Updated 2 years ago
- Complements Minimap2 for a fast and efficient Read-Until pipeline☆12Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- BLEND is a mechanism that can efficiently find fuzzy seed matches between sequences to significantly improve the performance and accuracy…☆42Updated last year
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 3 years ago
- A fuzzy Bruijn graph approach to long noisy reads assembly☆39Updated 7 years ago
- ☆28Updated last year
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated last year
- ☆17Updated last year
- Rust implementation of VG handle graph☆20Updated last year
- Parallel Sequence to Graph Alignment☆35Updated 2 years ago
- genome variation graphs constructed from HLA GRCh38 ALTs☆22Updated 3 years ago