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