Navarro (Sequence-to-Graph Alignment Sequence-to-Graph Alignment)

From Algorithm Wiki

Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (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.ezproxy.canberra.edu.au/science/article/pii/S0304397599003333")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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.ezproxy.canberra.edu.au/science/article/pii/S0304397599003333

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Navarro_(Sequence-to-Graph_Alignment_Sequence-to-Graph_Alignment)&oldid=45505"