Amir et al. (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)

From Algorithm Wiki
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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-63307-3_56

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Amir_et_al._(Sequence-to-Graph_Alignment_Sequence-to-Graph_Alignment)&oldid=45504"