Rautiainen and Marschall (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(|V | + m|E|)$ == Space Complexity == $O(\sqrt(m)|V|)$ words (same paper) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2017 == Reference == https://www.biorxiv.org/content/10.1101/216127v1")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(|V | + m|E|)$

Space Complexity

$O(\sqrt(m)|V|)$ words

(same paper)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2017

Reference

https://www.biorxiv.org/content/10.1101/216127v1

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