Overlap Layout Consensus (De Novo Genome Assembly De Novo Genome Assembly): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:3911:39, 15 February 2023‎ Admin talk contribs‎ 525 bytes +525‎ 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Overlap_Layout_Consensus_(De_Novo_Genome_Assembly_De_Novo_Genome_Assembly)"