<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Kartelj Aleksandar | AC Group | TU Wien</title><link>https://ac.tuwien.ac.at/team/kartelj-aleksandar/</link><atom:link href="https://ac.tuwien.ac.at/team/kartelj-aleksandar/index.xml" rel="self" type="application/rss+xml"/><description>Kartelj Aleksandar</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Fri, 01 Jan 2021 00:00:00 +0000</lastBuildDate><image><url>https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.png</url><title>Kartelj Aleksandar</title><link>https://ac.tuwien.ac.at/team/kartelj-aleksandar/</link></image><item><title>Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Strings</title><link>https://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/</guid><description/></item><item><title>Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Strings</title><link>https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/</guid><description/></item></channel></rss>