Kingsford-Group / omhismb2019
☆23Updated last year
Alternatives and similar repositories for omhismb2019:
Users that are interested in omhismb2019 are comparing it to the libraries listed below
- Benchmarking pairwise aligners☆36Updated 2 months ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆49Updated last month
- ☆17Updated last year
- Parallel Sequence to Graph Alignment☆35Updated 2 years ago
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- Iterate over minimizers of a DNA sequence☆28Updated 9 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- ☆25Updated 3 years ago
- Paired reads mapping on de Bruijn graph☆13Updated 6 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆24Updated last month
- ☆14Updated 2 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Fast and accurate set similarity estimation via containment min hash☆42Updated 8 months ago
- ☆15Updated last year
- Fast and precise comparison of genomes and metagenomes (in the order of terabytes) on a typical personal laptop☆59Updated last year
- Alignment algorithm for short Illumina reads to a de Bruijn graph☆16Updated 5 years ago
- RabbitMash: an efficient highly optimized implementation of Mash.☆21Updated last year
- Given a set of kmers (fasta format) and a set of sequences (fasta format), this tool will extract the sequences containing the kmers.☆21Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Validation of sycnmers compared to minimizers☆11Updated 4 years ago
- Python bindings to spoa☆20Updated last year
- GFA insert into GenomicSQLite☆49Updated 3 years ago
- VariantStore: A Large-Scale Genomic Variant Search Index☆39Updated 3 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 months ago
- Minimalistic aligner which uses Minimap for input mapping locations and Edlib for fast bitvector alignment.☆10Updated 7 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated last month
- ☆8Updated 3 years ago
- REINDEER REad Index for abuNDancE quERy☆57Updated 8 months ago
- A long read simulator based on badread idea☆22Updated 2 years ago