pesho-ivanov / minSHLinks
A minimal Python re-implementation of the A* with seed heuristic for exact global alignment (edit distance) in near-linear time
☆22Updated 9 months ago
Alternatives and similar repositories for minSH
Users that are interested in minSH are comparing it to the libraries listed below
Sorting:
- Ultrafast consensus module for raw de novo genome assembly of long uncorrected reads☆17Updated 4 years ago
- Catalogue of pairwise alignment algorithms and benchmarks☆24Updated last year
- A repository for the GenGraph toolkit for the creation and manipulation of graph genomes☆51Updated 4 years ago
- AStarix: Fast and Optimal Sequence-to-Graph Aligner☆74Updated 3 years ago
- ☆20Updated 5 years ago
- Minhash and maxhash library in Python, combining flexibility, expressivity, and performance.☆22Updated 9 months ago
- Deep learning library for biological sequences. Extension of Fastai and Pytorch.☆39Updated 3 months ago
- Python and Rust library for loading, saving, and manipulating taxonomic trees☆38Updated last month
- Tools and utilities for running Dockerized metagenomics tools in the Cloud☆22Updated 6 years ago
- Construct a Physical Map from Linked Reads☆18Updated last year
- VCF Observer is a VCF file analysis, comparison, and visualization tool.☆18Updated 8 months ago
- The PanGenome Graph Builder☆16Updated last year
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆26Updated 3 years ago
- GRAph-based Finding of Individual Motif Occurrences☆31Updated last year
- Bidirectional WFA (Paper)☆47Updated last year
- Align sequences and then parse features.☆17Updated 5 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 6 years ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- abi2fastq is a small utility to convert Sanger sequencing reads in .abi (applied biosystems) format to FASTQ☆11Updated 8 years ago
- toolkit for file system virtualisation of random access compressed FASTA, FAI, DICT & TWOBIT files☆22Updated last year
- Pairwise nucleotide alignment benchmark of Rust bindings☆30Updated 2 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.☆52Updated last week
- A tool for simulating random mutations in any genome☆42Updated last year
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 2 months ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆55Updated last year
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- Fishers Exact Test for Python (Cython)☆66Updated 6 months ago
- A graph-inspired data structure for determining likely chains of sequences from breadcrumbs of evidence☆16Updated 4 years ago