diff --git a/README.md b/README.md
index 2697b56..ef43f10 100644
--- a/README.md
+++ b/README.md
@@ -16,6 +16,8 @@ gfatools gfa2fa -s out.gfa > out.fa
 
 ## Table of Contents
 
+<img align="right" width="278" src="doc/example1.png"/>
+
 - [Getting Started](#started)
 - [Introduction](#intro)
 - [Users' Guide](#uguide)
@@ -28,8 +30,6 @@ gfatools gfa2fa -s out.gfa > out.fa
 
 ## <a name="intro"></a>Introduction
 
-<img align="right" width="278" src="doc/example1.png"/>
-
 Minigraph is a *proof-of-concept* sequence-to-graph mapper and graph
 constructor. It finds *approximate* locations of a query sequence in a sequence
 graph and incrementally augments an existing graph with long query subsequences
@@ -50,6 +50,8 @@ non-standard dependency is [zlib][zlib].
 
 ### <a name="map"></a>Sequence-to-graph mapping
 
+<img align="right" width="278" src="doc/example2.png"/>
+
 To map sequences against a graph, you should prepare the graph in the [GFA
 format][gfa1], or preferrably the [rGFA format][rgfa]. If you don't have
 a graph, you can generate a graph from multiple samples (see the [Graph
diff --git a/doc/example2.png b/doc/example2.png
new file mode 100644
index 0000000..d2484b7
Binary files /dev/null and b/doc/example2.png differ