Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)
Jump to navigation
Jump to search
Time Complexity
$O(m(n \log m + E)$)
Space Complexity
$O(mn)$ words
(https://www-sciencedirect-com.ezproxy.canberra.edu.au/science/article/pii/S0304397599003333)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1997
Reference
https://link-springer-com.ezproxy.canberra.edu.au/chapter/10.1007/3-540-63307-3_56