<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dirros.openscience.si/IzpisGradiva.php?id=20991"><dc:title>Efficient search algorithms for the restricted longest common subsequence problem</dc:title><dc:creator>Djukanović,	Marko	(Avtor)
	</dc:creator><dc:creator>Kartelj,	Aleksandar	(Avtor)
	</dc:creator><dc:creator>Eftimov,	Tome	(Avtor)
	</dc:creator><dc:creator>Reixach,	Jaume	(Avtor)
	</dc:creator><dc:creator>Blum,	C.	(Avtor)
	</dc:creator><dc:publisher>Springer Nature </dc:publisher><dc:date>2024</dc:date><dc:date>2024-12-13 10:48:47</dc:date><dc:type>Neznano</dc:type><dc:identifier>20991</dc:identifier><dc:source>Švica</dc:source><dc:language>sl</dc:language><dc:rights>© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG</dc:rights></rdf:Description></rdf:RDF>