Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(m(|n | log |m | + |E|)$) == Space Complexity == $O(mn)$ words (https://reader.elsevier.com/reader/sd/pii/S0304397599003333?token=C0E6BDF7BA98CD5C338EDB86675CB3A29AF44F5B046E169EE0F115788255757C815F0F0307EAF080CDF9A9DE7AA37764) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1997 == Reference == https://link.springer.com/chapter/10.1007/3-540-633...") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(m( | $O(m(n \log m + E)$) | ||
== Space Complexity == | == Space Complexity == | ||
| Line 7: | Line 7: | ||
$O(mn)$ words | $O(mn)$ words | ||
(https:// | (https://www.sciencedirect.com/science/article/pii/S0304397599003333) | ||
== Description == | == Description == | ||
Latest revision as of 09:50, 10 April 2023
Time Complexity
$O(m(n \log m + E)$)
Space Complexity
$O(mn)$ words
(https://www.sciencedirect.com/science/article/pii/S0304397599003333)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1997