Microassembly based somatic variant caller for NGS data
-
Updated
Jun 23, 2022 - C
#
debruijn-graph
Here are 19 public repositories matching this topic...
Compacted and colored de Bruijn graph construction and querying
rust bioinformatics sequencing bioinformatics-pipeline genome-assembly de-novo-assembly debruijn-graph
-
Updated
Dec 23, 2024 - Rust
MindTheGap is a SV caller for short read sequencing data dedicated to insertion variants (all sizes and types). It can also be used as a local assembly tool.
-
Updated
Apr 20, 2022 - C++
Assembled Phi-X174 genome using Overlap Graph, Kmer Composition and De-Bruijn Graph.
java graph graph-algorithms directed-graph error-correcting genome-sequencing cycles genome-assembly reads eulerian-circuit hamiltonian-cycles debruijn-graph overlap-graph kmer-composition phi-x174 tip-removal bubble-detection
-
Updated
May 27, 2018 - Java
This repository contains all the solutions of assignments, starter files and other materials related to this specialization.
algorithms graph-algorithms linear-programming data-structures sorting-algorithms dynamic-programming shortest-paths searching-algorithms minimum-spanning-trees greedy-algorithms sat streaming-algorithms maxflow genome-assembly string-algorithms burrows-wheeler-transform divide-and-conquer debruijn-graph suffix-trees np-completeness
-
Updated
Jan 31, 2021 - Java
K-mer counting with low memory consumption enables de novo assembly of 106x human sequence data in 2.7 hours
-
Updated
Aug 4, 2021 - C++
SNP calling pipeline using mccortex
-
Updated
Jun 10, 2018 - Python
🃏 creating a cool magic trick with de Bruijn arbitrary sequences
-
Updated
Dec 3, 2018 - Java
The phi X 174 bacteriophage is a single-stranded DNA virus that infects Escherichia coli (E. Coli), and the first DNA-based genome to be sequenced. This work was completed by Fred Sanger and his team in 1977. This repository contains simple assembler, different components of it and various error correction techniques for assembling Phi X 174 bac…
-
Updated
Jul 17, 2021 - Java
A fork of the original https://github.com/medvedevgroup/UST tool.
-
Updated
Mar 3, 2022 - C++
String re-construction using the concepts of de Bruijn graph and Eulerian path.
-
Updated
Aug 27, 2022 - Jupyter Notebook
Project for the course of Elementi di Bioinformatica AY 2017/2018
-
Updated
Mar 2, 2018 - C
Programas usados em BioInformática
needleman-wunsch transcription debruijn bioinformatics-scripts needleman-wunsch-algorithm needleman debruijn-graph ribosome bioinformatica
-
Updated
Nov 16, 2021 - Jupyter Notebook
PoC - De Bruijn graph with PGMIndex
bioinformatics compression big-data indexing data-structures poc debruijn-graph succinct-data-structure learned-index
-
Updated
Jan 4, 2022 - C++
Coding problems from course 2 of the Bioinformatics specialization
bioinformatics genome genome-assembly bioinformatics-algorithms eulerian-path debruijn-graph read-pairs peptide-sequencing cyclopeptide-sequencing
-
Updated
Jun 17, 2020 - Python
Shell script for extracting sequences from high-degree nodes in metagenomic assembly graphs
-
Updated
Mar 14, 2022 - Shell
🛠️🧬De Bruijn graph-based genome assembler📈📊
-
Updated
Oct 10, 2024 - Python
Improve this page
Add a description, image, and links to the debruijn-graph topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the debruijn-graph topic, visit your repo's landing page and select "manage topics."