josch / cycles_hawick_jamesLinks
Finding all the circuits of a directed graph with self-arcs and multiple-arcs by K.A. Hawick and H.A. James
☆19Updated 12 years ago
Alternatives and similar repositories for cycles_hawick_james
Users that are interested in cycles_hawick_james are comparing it to the libraries listed below
Sorting:
- ☆20Updated 4 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- 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
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 8 years ago
- Proteins as words, genomes as documents.☆20Updated 4 years ago
- Hail: extract lines from a file, a la `head -n x | tail -n y`☆9Updated 4 years ago
- Static Huffman coding☆10Updated 8 years ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 7 years ago
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- Implementation for sGLMM (Sparse graph-structured linear mixed model)☆15Updated 2 years ago
- Stress-based Graph Drawing by Stochastic Gradient Descent☆47Updated 2 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Progress indicator library written in C.☆10Updated 7 months ago
- ☆13Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 5 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 6 years ago
- C++ library for parsing several formats in bioinformatics☆9Updated 2 years ago
- de Bruijn graph cOrrectiOn from graph aLignment☆11Updated 4 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- ☆14Updated 5 years ago
- This work presents a way to write extensions in Rust and use them in Python, using sourmash as an example.☆20Updated 6 years ago
- ☆14Updated 5 years ago
- Calculate indel trajectory likelihoods using methods of Miklós, Lunter & Holmes (2004), De Maio (2020), and Holmes (2020)☆14Updated 2 years ago
- The main website for the OpenMendel project.☆13Updated 2 years ago
- Universal K-mer Hitting Set library in Rust☆10Updated 4 years ago
- ☆11Updated 2 years ago
- A graph-inspired data structure for determining likely chains of sequences from breadcrumbs of evidence☆17Updated 3 years ago