HybridSpades (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(m(|V | log(m|V |)$ + |E|)) == Space Complexity == $O(m*(V+E)$) words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2015 == Reference == https://www-ncbi-nlm-nih-gov.ezproxy.canberra.edu.au/pubmed/26589280")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O(m*(V+E)$) words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2015

Reference

https://www-ncbi-nlm-nih-gov.ezproxy.canberra.edu.au/pubmed/26589280

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