Cited in
(88)- Bioinformatics for high throughput sequencing
- Popping superbubbles and discovering clumps: recent developments in biological sequence analysis
- Disentangled long-read de Bruijn graphs via optical maps
- Next generation sequencing under de novo genome assembly
- The exact multiple pattern matching problem solved by a reference tree approach
- Safe and complete contig assembly via omnitigs
- MULKSG: \textit{MUL}tiple \textit{K} \textit{S}imultaneous \textit{G}raph assembly
- A tale of optimizing the space taken by de Bruijn graphs
- On bubble generators in directed graphs
- Analysis method and algorithm design of biological sequence problem based on generalized k-mer vector
- Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds
- BrownieAligner
- Approximate all-pairs suffix/prefix overlaps
- Graph algorithms for DNA sequencing -- origins, current models and the future
- Describing the local structure of sequence graphs
- Coverage theories for metagenomic DNA sequencing based on a generalization of Stevens' theorem
- Fast approximation of frequent \(k\)-mers and applications to metagenomics
- DNA paired fragment assembly using graph theory
- ALLPATHS
- ARACHNE
- Linear-time superbubble identification algorithm for genome assembly
- CAP3
- Quake
- GRASS
- SCARPA
- SOPRA
- GAGE
- Samtools
- VCFtools
- IDBA-Tran
- IDBA-UD
- SEQuel
- SOAPdenovo
- ABySS
- QUAST
- SHRiMP
- MUMMER
- Genomatix
- Meta-IDBA
- SSAKE
- SPAdes
- T-IDBA
- CUDASW++
- dipSPAdes
- Meraculous-2D
- KMC
- BFAST
- PatternHunter
- Turtle
- G-DNA
- BLASTZ
- sequenceTubeMap
- BESST
- MEGAHIT
- ScaffMatch
- Mauve
- Bambus 2
- DARRC
- MULKSG
- QSRA
- MaSuRCA
- Phusion
- SHARCGS
- OMGS
- deBGA
- BWA
- CUSHAW
- Maligner
- GASSST
- OMBlast
- PBSIM
- PE-Assembler
- PerM
- KmerStream
- Kmerlight
- SAKEIMA
- RNA-Skim
- Squeakr
- BlastGraph
- IDBA
- DNA sequence assembly involving an acyclic graph model
- Bioinformatics. Volume I. Data, sequence analysis, and evolution
- The contig assembly problem and its algorithmic solutions
- ART
- Estimating sequence similarity from read sets for clustering next-generation sequencing data
- CUSHAW suite: parallel and efficient algorithms for NGS read alignment
- scientific article; zbMATH DE number 6403120 (Why is no real title available?)
- The complexity of approximate pattern matching on de Bruijn graphs
This page was built for software: Velvet
