jlguillaume / louvainLinks
C implementation of the Louvain method for community detection in graphs
☆12Updated 5 years ago
Alternatives and similar repositories for louvain
Users that are interested in louvain are comparing it to the libraries listed below
Sorting:
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 7 years ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 8 years ago
- SeqOthello supports fast coverage query and containment query.☆12Updated 6 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆26Updated 3 years ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 5 years ago
- ☆10Updated 2 years ago
- De novo genome assembler.☆11Updated 7 years ago
- ☆14Updated 5 years ago
- MEM mapper prototype☆13Updated 4 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 7 years ago
- Pan gGnome Viewer☆10Updated last month
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12Updated 12 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 6 years ago
- ECML16: GaKCo: a Fast Gapped k-mer string Kernel using Counting☆14Updated 6 years ago
- the we-flyin WFA-guided ultralong tiling sequence aligner☆11Updated 4 years ago
- ☆11Updated 2 years ago
- ☆25Updated last week
- High Performance Sorting Based Distributed memory K-mer counter☆14Updated 3 months ago
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆12Updated last year
- Add functional variant annotation to MAF file☆11Updated 9 months ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆11Updated 3 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Linear-time, low-memory construction of variation graphs☆20Updated 5 years ago
- Finding putative exons and constructing splicegraphs using Trans-ABySS contigs☆11Updated 6 years ago
- Next Index to Query Kmer Intersection☆16Updated 2 years ago
- Efficient C functions to compute the summary statistics (flagstats) for sequencing read sets.☆15Updated 5 years ago
- A pipeline for making SWIft Genomes in a Graph (SWIGG) using k-mers☆22Updated 5 years ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 8 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 6 years ago