<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Milana Grbić | AC Group | TU Wien</title><link>https://ac.notready.eu/author/milana-grbic/</link><atom:link href="https://ac.notready.eu/author/milana-grbic/index.xml" rel="self" type="application/rss+xml"/><description>Milana Grbić</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Sat, 01 Jan 2022 00:00:00 +0000</lastBuildDate><image><url>https://ac.notready.eu/media/logo_hu10234977157890132473.png</url><title>Milana Grbić</title><link>https://ac.notready.eu/author/milana-grbic/</link></image><item><title>Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequences</title><link>https://ac.notready.eu/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/</link><pubDate>Sat, 01 Jan 2022 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/</guid><description/></item><item><title>Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings</title><link>https://ac.notready.eu/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/</link><pubDate>Fri, 01 Jan 2021 00:00:00 +0000</pubDate><guid>https://ac.notready.eu/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/</guid><description/></item></channel></rss>