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

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n(V + E)$)

Space Complexity

$O(V)$ words

(https://www.sciencedirect.com/science/article/pii/S0304397599003333)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2000

Reference

https://www.sciencedirect.com/science/article/pii/S0304397599003333

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