pesho-ivanov / minSH
A minimal Python re-implementation of the A* with seed heuristic for exact global alignment (edit distance) in near-linear time
☆20Updated 2 months ago
Alternatives and similar repositories for minSH:
Users that are interested in minSH are comparing it to the libraries listed below
- ☆20Updated 4 years ago
- A fast seed-embed-extend based sequence mapper and aligner☆22Updated 5 months ago
- Java software to analyse phylogeny-trait correlations in discrete traits, accounting for phylogenetic uncertainty via posterior sampling.☆11Updated 7 years ago
- An experimental tool to estimate the similarity between all pairs of contigs☆35Updated 3 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 5 years ago
- AStarix: Fast and Optimal Sequence-to-Graph Aligner☆74Updated 3 years ago
- Minhash and maxhash library in Python, combining flexibility, expressivity, and performance.☆21Updated last month
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 2 years ago
- toolkit for file system virtualisation of random access compressed FASTA, FAI, DICT & TWOBIT files☆22Updated 5 months ago
- Bidirectional WFA (Paper)☆44Updated 8 months ago
- Pipeline for the identification of (coding) gene structures in draft genomes.☆26Updated 8 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- Metalign: efficient alignment-based metagenomic profiling via containment min hash☆33Updated last year
- Catalogue of pairwise alignment algorithms and benchmarks☆25Updated 5 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- C++ library for parsing several formats in bioinformatics☆9Updated last year
- LMS algorithm for computing edit distance with SIMD optimizations☆11Updated 10 months ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Updated last year
- A fast and space-efficient pre-filter for estimating the quantification of very large collections of nucleotide sequences☆14Updated this week
- Lightweight header-only C++ library for loading and traversing trees☆11Updated last month
- A compressed, associative, exact, and weighted dictionary for k-mers.☆86Updated 3 months ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 3 years ago
- Ultrafast consensus module for raw de novo genome assembly of long uncorrected reads☆16Updated 4 years ago
- Bonsai: Fast, flexible taxonomic analysis and classification☆70Updated 9 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 years ago
- Orpheum (Previously called and published under sencha) is a Python package for directly translating RNA-seq reads into coding protein seq…☆18Updated 2 years ago
- Construct a Physical Map from Linked Reads☆18Updated 9 months ago
- FFPopSim is a collection of C++ classes and a Python interface for efficient simulation of large populations, in particular when the prod…☆13Updated last year
- Tool to estimate deltas for sequence sets and answer questions about relative contribution☆21Updated 2 weeks ago
- Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a sing…☆27Updated 4 years ago