String Graph with Ferragina–Manzini Index (Simpson, Durbin) (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)$ == 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 == 2010 == Reference == https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2881401/pdf/btq217.pdf")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(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

2010

Reference

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2881401/pdf/btq217.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=String_Graph_with_Ferragina–Manzini_Index_(Simpson,_Durbin)_(De_Novo_Genome_Assembly_De_Novo_Genome_Assembly)&oldid=44850"