Line 260: | Line 260: | ||
<p>The image (a bitmap) is scanned pixel by pixel and written into a temporary file where it is checked for similarity with another image using the Damerau - Levenshtein Distance algorithm which was coded in C#. This can be represented as such <sup> 1 </sup>: </p> | <p>The image (a bitmap) is scanned pixel by pixel and written into a temporary file where it is checked for similarity with another image using the Damerau - Levenshtein Distance algorithm which was coded in C#. This can be represented as such <sup> 1 </sup>: </p> | ||
− | <p> Figure 1 </p> | + | <p style="text-align: center;" > Figure 1 </p> |
<img src="https://static.igem.org/mediawiki/2017/0/0e/T--UNOTT--DLD.svg" width="600" height="100" > | <img src="https://static.igem.org/mediawiki/2017/0/0e/T--UNOTT--DLD.svg" width="600" height="100" > | ||
Line 270: | Line 270: | ||
</center> | </center> | ||
<br> </br> | <br> </br> | ||
− | <img src="https://static.igem.org/mediawiki/2017/7/7c/T--UNOTT--LucyComparision.png" class="border" width="400" height="400" > | + | <img src="https://static.igem.org/mediawiki/2017/7/7c/T--UNOTT--LucyComparision.png" style="text-align: center;" class="border" width="400" height="400" > |
<br> </br> | <br> </br> | ||
Revision as of 21:19, 31 October 2017
SOFTWARE