String Graph (Myers) (De Novo Genome Assembly De Novo Genome Assembly)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n \log n)$

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/7497129

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=String_Graph_(Myers)_(De_Novo_Genome_Assembly_De_Novo_Genome_Assembly)&oldid=47443"