Scaling metagenome sequence assembly with probabilistic de Bruijn graphs (Q4907496): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Eulerian path approach to DNA fragment assembly / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Space/time trade-offs in hash coding with allowable errors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3550134 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Evolutionary Bioinformatics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Network Applications of Bloom Filters: A Survey / rank | |||
Normal rank | |||
Revision as of 03:39, 6 July 2024
scientific article; zbMATH DE number 6133965
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scaling metagenome sequence assembly with probabilistic de Bruijn graphs |
scientific article; zbMATH DE number 6133965 |
Statements
Scaling metagenome sequence assembly with probabilistic de Bruijn graphs (English)
0 references
2 February 2013
0 references
deep sequencing
0 references
complex populations
0 references
memory-efficient graph representation
0 references
\(k\)-mer connectivity
0 references
