Cited in
(88)- Long Reads Enable Accurate Estimates of Complexity of Metagenomes
- Disentangled long-read de Bruijn graphs via optical maps
- The exact multiple pattern matching problem solved by a reference tree approach
- Probabilistic models for error correction of nonuniform sequencing data
- Safe and complete contig assembly via omnitigs
- A mixed integer linear programming algorithm for plasmid binning
- MULKSG: \textit{MUL}tiple \textit{K} \textit{S}imultaneous \textit{G}raph assembly
- Synteny paths for assembly graphs comparison
- A tale of optimizing the space taken by de Bruijn graphs
- An external-memory algorithm for string graph construction
- Linking indexing data structures to de Bruijn graphs: construction and update
- BMC3C
- Superstring graph: a new approach for genome assembly
- Bidirectional Variable-Order de Bruijn Graphs
- MetaCoAG: binning metagenomic contigs via composition, coverage and assembly graphs
- AMBER
- ALLPATHS
- Quake
- ExSPAnder
- GAGE
- HHblits
- IDBA-UD
- Mugsy
- Prodigal
- EMIRGE
- FragGeneScan
- SEQuel
- SOAPdenovo
- ABySS
- QUAST
- Meta-IDBA
- SSAKE
- Velvet
- dipSPAdes
- Bio++
- BEETL
- CLARK
- MetaProb
- Sibelia
- BESST
- MEGAHIT
- Minimap2
- CYNTENATOR
- DARRC
- i-ADHoRe
- MULKSG
- QSRA
- Phusion
- SHARCGS
- PathRacer
- OMGS
- Rainbowfish
- Maligner
- Fiona
- OMBlast
- PBSIM
- MetAMOS
- LoRDEC
- MindTheGap
- PE-Assembler
- Kraken
- Squeakr
- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
- gCol
- HyAsP
- CheckM
- GraphBin
- IDBA
- AGB
- Bandage
- MetaCoAG
- METAMVGL
- CAMSA
- metaSPAdes
- Asgan
- metaFlye
- Canu
- Centrifuge
- GTED
- HINGE
- MaxBin
- MetaBAT
- oblr
- SolidBin
- Unicycler
- Bioinformatics. Volume I. Data, sequence analysis, and evolution
- The contig assembly problem and its algorithmic solutions
- Data mining techniques for the life sciences
This page was built for software: SPAdes
