Navarro (Sequence-to-Graph Alignment Sequence-to-Graph Alignment): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n(|V | + |E|)$) == Space Complexity == $O(V)$ words (same paper) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.sciencedirect.com/science/article/pii/S0304397599003333") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n( | $O(n(V + E)$) | ||
== Space Complexity == | == Space Complexity == | ||
| Line 7: | Line 7: | ||
$O(V)$ words | $O(V)$ words | ||
( | (https://www.sciencedirect.com/science/article/pii/S0304397599003333) | ||
== Description == | == Description == | ||
Latest revision as of 09:50, 10 April 2023
Time Complexity
$O(n(V + E)$)
Space Complexity
$O(V)$ words
(https://www.sciencedirect.com/science/article/pii/S0304397599003333)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2000
Reference
https://www.sciencedirect.com/science/article/pii/S0304397599003333