SPAdes

swMATH17004MaRDI QIDQ28865FDOQ28865

Author name not available (Why is that?)

Cited In (18)

• Probabilistic models for error correction of nonuniform sequencing data
• MULKSG: \textit{MUL}tiple \textit{K} \textit{S}imultaneous \textit{G}raph assembly
• On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
• Safe and complete contig assembly via omnitigs
• A tale of optimizing the space taken by de Bruijn graphs
• An external-memory algorithm for string graph construction
• Synteny paths for assembly graphs comparison
• Data mining techniques for the life sciences
• Bidirectional Variable-Order de Bruijn Graphs
• Long Reads Enable Accurate Estimates of Complexity of Metagenomes
• Superstring graph: a new approach for genome assembly
• Disentangled long-read de Bruijn graphs via optical maps
• The exact multiple pattern matching problem solved by a reference tree approach
• A mixed integer linear programming algorithm for plasmid binning
• Bioinformatics. Volume I. Data, sequence analysis, and evolution
• The contig assembly problem and its algorithmic solutions
• MetaCoAG: binning metagenomic contigs via composition, coverage and assembly graphs
• Linking indexing data structures to de Bruijn graphs: construction and update

This page was built for software: SPAdes