jlguillaume / louvainLinks
C implementation of the Louvain method for community detection in graphs
☆11Updated 5 years ago
Alternatives and similar repositories for louvain
Users that are interested in louvain are comparing it to the libraries listed below
Sorting:
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 6 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Updated 8 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆11Updated 7 years ago
- Pan gGnome Viewer☆10Updated 5 months ago
- SeqOthello supports fast coverage query and containment query.☆12Updated 6 years ago
- ☆14Updated 5 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 6 years ago
- SUPBUB is a tool that, in linear time, finds out superbubbles(special graph-structures) in a directed graph.☆12Updated 6 years ago
- MEM mapper prototype☆13Updated 5 years ago
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- ECML16: GaKCo: a Fast Gapped k-mer string Kernel using Counting☆14Updated 6 years ago
- Add functional variant annotation to MAF file☆11Updated last year
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- ☆11Updated 2 years ago
- the we-flyin WFA-guided ultralong tiling sequence aligner☆10Updated 4 years ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- ☆11Updated 3 years ago
- De novo genome assembler.☆11Updated 7 years ago
- High Performance Sorting Based Distributed memory K-mer counter☆15Updated last week
- Finding putative exons and constructing splicegraphs using Trans-ABySS contigs☆11Updated 7 years ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 8 years ago
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆11Updated last year
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- Importing vg json graphs to Python data structures.☆12Updated 5 years ago
- Implementation for sGLMM (Sparse graph-structured linear mixed model)☆15Updated 2 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- Translocator: local realignment and global remapping enabling accurate translocation detection using single-molecule sequencing long read…☆12Updated 5 years ago
- MAW: a suite on the computation and application of Minimal Absent Words☆16Updated 4 years ago
- ☆24Updated 3 months ago