fix images

luizirber · May 4, 2017 · afaab9a · afaab9a
1 parent 5eb8fa6
commit afaab9a
Show file tree

Hide file tree

Showing 3 changed files with 2 additions and 2 deletions.
diff --git a/01.intro.md b/01.intro.md
@@ -8,10 +8,10 @@ To be able to efficiently search for matches of these signatures in the RefSeq m
 [![](poster/figures/sbtmh.png)](poster/figures/sbtmh.svg)
 *The SBTMH is a binary tree where leaf nodes are MinHash signatures and internal nodes are Bloom Filters. Each Bloom Filter can be queried for approximate membership of all the values from its children, and so the root node roughly represents all the values from all signatures in the tree.*
 
-![](poster/figures/sbtmh_query.svg)
+[![](poster/figures/sbtmh_query.png)](poster/figures/sbtmh_query.svg)
 *Searching for similarity to a query signature involves checking for query elements present in each internal node, and if it doesn't reach the threshold the subtree is pruned. If a leaf is reached, it is returned as a match to the query signature.*
 
-![](poster/figures/sbtmh_insert.svg)
+[![](poster/figures/sbtmh_insert.png)](poster/figures/sbtmh_insert.svg)
 *Adding a new signature to SBTMH causes parent nodes to be updated, but other nodes are not affected. This means users from both SBTMH can benefit from increased availability of the data for the nodes that didn't change (and are shared among trees).*
 
 ## Further reading

diff --git a/poster/figures/sbtmh_insert.png b/poster/figures/sbtmh_insert.png
diff --git a/poster/figures/sbtmh_query.png b/poster/figures/sbtmh_query.png