SPAdes
From MaRDI portal
Software:28865
No author found.
Related Items (18)
Long Reads Enable Accurate Estimates of Complexity of Metagenomes ⋮ An external-memory algorithm for string graph construction ⋮ Data mining techniques for the life sciences ⋮ On the Sound Covering Cycle Problem in Paired de Bruijn Graphs ⋮ Bidirectional Variable-Order de Bruijn Graphs ⋮ A mixed integer linear programming algorithm for plasmid binning ⋮ MetaCoAG: binning metagenomic contigs via composition, coverage and assembly graphs ⋮ Linking indexing data structures to de Bruijn graphs: construction and update ⋮ Probabilistic Models for Error Correction of Nonuniform Sequencing Data ⋮ The Contig Assembly Problem and Its Algorithmic Solutions ⋮ Bioinformatics. Volume I. Data, sequence analysis, and evolution ⋮ The exact multiple pattern matching problem solved by a reference tree approach ⋮ Safe and Complete Contig Assembly Via Omnitigs ⋮ Synteny Paths for Assembly Graphs Comparison ⋮ Superstring Graph: A New Approach for Genome Assembly ⋮ MULKSG: \textit{MUL}tiple \textit{K} \textit{S}imultaneous \textit{G}raph assembly ⋮ Disentangled Long-Read De Bruijn Graphs via Optical Maps ⋮ A tale of optimizing the space taken by de Bruijn graphs
This page was built for software: SPAdes
