<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Določanje sekvence DNK na osnovi Eulerjeve poti z uporabo izboljšanega Hierholzerjevega algoritma</dc:title><dc:creator>Mesarić,	Filip	(Avtor)
	</dc:creator><dc:creator>Mongus,	Domen	(Mentor)
	</dc:creator><dc:subject>DNA</dc:subject><dc:subject>Eulerian path</dc:subject><dc:subject>Hierholzer’s algorithm</dc:subject><dc:subject>DNA sequencing</dc:subject><dc:description>In the master’s thesis we created the algorithm for DNA sequencing based on an Eulerian path 
and the improved Hierholzer’s algorithm. The theoretical part explains the graph theory, 
existing Eulerian path searching algorithms and Hierholzer's algorithmic implementations. 
Additionally, the theoretical part presents DNA sequencing and its most popular methods. The 
practical part focuses on the development of an application that shows DNA sequencing based 
on an Eulerian path and the improved Hierholzer's algorithm. The results represent an 
improvement of sequencing, taking into consideration time and distance measurements, for 
our implementation in comparison with the existing Hierholzer’s algorithm.</dc:description><dc:publisher>F. Mesarić</dc:publisher><dc:date>2019</dc:date><dc:date>2019-03-29 14:39:20</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>73363</dc:identifier><dc:identifier>UDK: 004.421(043.2)</dc:identifier><dc:identifier>COBISS_ID: 22512406</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:XEUXZVPT</dc:identifier><dc:language>sl</dc:language></metadata>
