Ritu-Kundu / SuperbubblesLinks
SUPBUB is a tool that, in linear time, finds out superbubbles(special graph-structures) in a directed graph.
☆12Updated 6 years ago
Alternatives and similar repositories for Superbubbles
Users that are interested in Superbubbles are comparing it to the libraries listed below
Sorting:
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- ☆24Updated 2 months ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 6 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- ☆28Updated 7 months ago
- ☆14Updated 5 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- GBWT-based handle graph☆31Updated last week
- Linear-time, low-memory construction of variation graphs☆20Updated 5 years ago
- ☆13Updated 9 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Updated 8 years ago
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆11Updated last year
- ☆11Updated 2 years ago
- A script to extract graph structure from multiple sequence alignment result and output as GFA/JSON for vg☆11Updated 6 years ago
- ☆24Updated 4 years ago
- Tool (experimental) to compute layout from overlaps with spectral algorithm☆11Updated 7 years ago
- reference free variant assembly☆34Updated 2 years ago
- Pan-genome Seed Index☆20Updated 8 months ago
- Lift-over alignments from variant-aware references☆34Updated 2 years ago
- Long read to reference genome mapping tool☆13Updated last year
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 5 years ago
- syncmer graphs, and perhaps other sorts of sequence graphs☆23Updated last week
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- Parallel Sequence to Graph Alignment☆36Updated 2 years ago
- Long Approximate Matches-based Split Aligner☆13Updated 8 years ago
- ☆16Updated 3 years ago
- De Bruijn graph representation in low memory☆35Updated last year