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:
- 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
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Online material and code base for the article Coordinates and Intervals in Graph Based Reference Genomes☆11Updated 8 years ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- MAW: a suite on the computation and application of Minimal Absent Words☆16Updated 3 years ago
- EXPERIMENTAL implementation of side graph☆10Updated 10 years ago
- Probabilistic single-cell pseudotime with Edward+Tensorflow☆12Updated 8 years ago
- ☆15Updated 9 years ago
- ☆14Updated 5 years ago
- Proteins as words, genomes as documents.☆19Updated 4 years ago
- C implementation of the Louvain method for community detection in graphs☆12Updated 5 years ago
- ☆20Updated 5 years ago
- A varitation graph tool☆10Updated 5 years ago
- Stress-based Graph Drawing by Stochastic Gradient Descent☆48Updated 2 years ago
- Zero-inflated mixture model for single-cell data.☆14Updated 9 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- Directly create a bigwig file with signal derived from a sorted and indexed bam file.☆11Updated 8 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Updated 8 years ago
- Wiki form of BLAST documentation from NCBI☆16Updated 8 years ago
- Calculate indel trajectory likelihoods using methods of Miklós, Lunter & Holmes (2004), De Maio (2020), and Holmes (2020)☆14Updated 3 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 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
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆26Updated 3 years ago
- Finding putative exons and constructing splicegraphs using Trans-ABySS contigs☆11Updated 6 years ago
- succinct labeled graphs with collections and paths☆15Updated 6 years ago
- de Bruijn CompAction in Low Memory☆22Updated 9 years ago
- SeqOthello supports fast coverage query and containment query.☆12Updated 6 years ago
- ☆12Updated 8 years ago
- pyABC: distributed, likelihood-free inference☆13Updated 7 years ago
- Implementation for sGLMM (Sparse graph-structured linear mixed model)☆15Updated 2 years ago