View source for Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly)

== 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 ==