Scaling metagenome sequence assembly with probabilistic de Bruijn graphs (Q4907496): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/pnas/PellHCHTB12, #quickstatements; #temporary_batch_1731508824982
 
(7 intermediate revisions by 6 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ALLPATHS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAGE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163830511 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q36170818 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1112.4193 / rank
 
Normal rank
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
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/pnas/PellHCHTB12 / rank
 
Normal rank

Latest revision as of 16:29, 13 November 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
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references