Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly)

From Algorithm Wiki
Revision as of 11:39, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$? words (Computes and stores all acceptable overlaps among all fragment pairs, along with detailed information regarding alignment, during one of the steps. Overlap graph has size at most O(n^2), layout and consensus should not take up more than O(n^2) space) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$? words

(Computes and stores all acceptable overlaps among all fragment pairs, along with detailed information regarding alignment, during one of the steps. Overlap graph has size at most O(n^2), layout and consensus should not take up more than O(n^2) space)

Description

Approximate?

Approximate

Approximation Factor:

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1987

Reference

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