The following pages link to SPAdes (Q28865):
Displaying 18 items.
- Data mining techniques for the life sciences (Q293808) (← links)
- Bioinformatics. Volume I. Data, sequence analysis, and evolution (Q505398) (← links)
- The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
- A tale of optimizing the space taken by de Bruijn graphs (Q2117772) (← links)
- A mixed integer linear programming algorithm for plasmid binning (Q2163971) (← links)
- MetaCoAG: binning metagenomic contigs via composition, coverage and assembly graphs (Q2170126) (← links)
- MULKSG: \textit{MUL}tiple \textit{K} \textit{S}imultaneous \textit{G}raph assembly (Q2315511) (← links)
- An external-memory algorithm for string graph construction (Q2362353) (← links)
- Linking indexing data structures to de Bruijn graphs: construction and update (Q2424683) (← links)
- Safe and Complete Contig Assembly Via Omnitigs (Q2814598) (← links)
- Superstring Graph: A New Approach for Genome Assembly (Q2830057) (← links)
- Probabilistic Models for Error Correction of Nonuniform Sequencing Data (Q3305524) (← links)
- The Contig Assembly Problem and Its Algorithmic Solutions (Q3305536) (← links)
- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs (Q3452560) (← links)
- Synteny Paths for Assembly Graphs Comparison (Q5091750) (← links)
- Disentangled Long-Read De Bruijn Graphs via Optical Maps (Q5111789) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q5384620) (← links)
- Long Reads Enable Accurate Estimates of Complexity of Metagenomes (Q5881332) (← links)
