Rautiainen, Marschall (Sequence-to-Graph Alignment Sequence-to-Graph Alignment): 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.

10 April 2023

15 February 2023

  • curprev 12:1712:17, 15 February 2023‎ Admin talk contribs‎ 504 bytes +504‎ Created page with "== Time Complexity == $O(|V | + m|E|)$ == Space Complexity == $O(mV)$ words (Derived: algorithm uses a V-sized array of bitvectors each of which is of length m, and also uses a priority queue which has at most V elements. The precomputed pattern bitvectors also takes up O(V * m) space.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2019 == Reference == https://www.ncb..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Rautiainen,_Marschall_(Sequence-to-Graph_Alignment_Sequence-to-Graph_Alignment)"