De Bruijn Graph (Idury, Waterman) (De Novo Genome Assembly De Novo Genome Assembly)

From Algorithm Wiki
Revision as of 11:52, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n)$? words (Requires computing O(n) overlaps for graph; data structures are otherwise linear in space usage) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1994 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/7497130")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n)$? words

(Requires computing O(n) overlaps for graph; data structures are otherwise linear in space usage)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1994

Reference

https://www.ncbi.nlm.nih.gov/pubmed/7497130

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=De_Bruijn_Graph_(Idury,_Waterman)_(De_Novo_Genome_Assembly_De_Novo_Genome_Assembly)&oldid=44849"