Pages that link to "Item:Q4907496"
From MaRDI portal
The following pages link to Scaling metagenome sequence assembly with probabilistic de Bruijn graphs (Q4907496):
Displaying 14 items.
- Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences (Q315651) (← links)
- Coverage theories for metagenomic DNA sequencing based on a generalization of Stevens' theorem (Q378317) (← links)
- Analysis of a data matrix and a graph: metagenomic data and the phylogenetic tree (Q765971) (← links)
- Metagenomic reads binning with spaced seeds (Q1676311) (← links)
- Improving MinHash via the containment index with applications to metagenomic analysis (Q2011091) (← links)
- A tale of optimizing the space taken by de Bruijn graphs (Q2117772) (← links)
- The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
- PathRacer: racing profile HMM paths on assembly graph (Q2315503) (← 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)
- The Contig Assembly Problem and Its Algorithmic Solutions (Q3305536) (← links)
- (Q5172163) (← links)
- Bloom Filter Trie – A Data Structure for Pan-Genome Storage (Q5283830) (← links)
- Economic genome assembly from low coverage illumina and nanopore data (Q6487638) (← links)
