Georgios Stamoulis

Georgios Stamoulis

Auto-generated profile, based on publicly available information

Georgios Stamoulis

Maastricht University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 August 2017 in Algorithmica
Verified
Journal Article
Open access
PDF file
LILeo van Iersel
Leo van Iersel
SKSteven Kelk
Steven Kelk
GSGeorgios Stamoulis
Georgios Stamoulis
LSLeen Stougie
Leen Stougie
OBOlivier Boes
Olivier Boes
The hybridization number problem requires us to embed a set of binary rooted phylogenetic trees into a binary rooted phylogenetic network such that the number of nodes with indegree two is minimized. However, from a biological point of view accurately inferring the root location in a phylogenetic tree is notoriously difficult and poor root placement can artificially inflate the hybridization number. To this end we study a number of relaxed variants of this problem. We start by showing that the fundamental problem of determining whether an unrooted phylogenetic network displays (i.e. embeds) an unrooted phylogenetic tree, is NP-hard. On the positive side we show that this problem is FPT in reticulation number. In the rooted case the corresponding FPT result is trivial, but here we require more subtle argumentation. Next we show that the hybridization number problem for unrooted networks (when given two unrooted trees) is equivalent to the problem of computing the tree bisection and reconnect distance of the two unrooted trees. In the third part of the paper we consider the “root uncertain” variant of hybridization number. Here we are free to choose the root location in each of a set of unrooted input trees such that the hybridization number of the resulting rooted trees is minimized. On the negative side we show that this problem is APX-hard. On the positive side, we show that the problem is FPT in the hybridization number, via kernelization, for any number of input trees.

19 November 2021 in Annals of Operations Research
Verified
Journal Article
Open access
PDF file
RWRim van Wersch
Rim van Wersch
SKSteven Kelk
Steven Kelk
SLSimone Linz
Simone Linz
GSGeorgios Stamoulis
Georgios Stamoulis
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. Here we explore the practical impact of kernelization (i.e. data reduction) on the NP-hard problem of computing the TBR distance between two unrooted binary phylogenetic trees. This problem is better-known in the literature as the maximum agreement forest problem, where the goal is to partition the two trees into a minimum number of common, non-overlapping subtrees. We have implemented two well-known reduction rules, the subtree and chain reduction, and five more recent, theoretically stronger reduction rules, and compare the reduction achieved with and without the stronger rules. We find that the new rules yield smaller reduced instances and thus have clear practical added value. In many cases they also cause the TBR distance to decrease in a controlled fashion, which can further facilitate solving the problem in practice. Next, we compare the achieved reduction to the known worst-case theoretical bounds of $$15k-9$$15k-9 and $$11k-9$$11k-9 respectively, on the number of leaves of the two reduced trees, wherekis the TBR distance, observing in both cases a far larger reduction in practice. As a by-product of our experimental framework we obtain a number of new insights into the actual computation of TBR distance. We find, for example, that very strong lower bounds on TBR distance can be obtained efficiently by randomly sampling certain carefully constructed partitions of the leaf labels, and identify instances which seem particularly challenging to solve exactly. The reduction rules have been implemented within our new solverTubrowhich combines kernelization with an Integer Linear Programming (ILP) approach. Tubro also incorporates a number of additional features, such as a cluster reduction and a practical upper-bounding heuristic, and it can leverage combinatorial insights emerging from the proofs of correctness of the reduction rules to simplify the ILP.

1 June 2018 in Theoretical Computer Science
Verified
Journal Article
Closed access
SKSteven Kelk
Steven Kelk
GSGeorgios Stamoulis
Georgios Stamoulis
TWTaoyang Wu
Taoyang Wu

21 January 2019
Verified
Conference Paper
Open access
PDF file
Charalampos AntoniadisCharalampos Antoniadis
Charalampos Antoniadis
NENestor Evmorfopoulos
Nestor Evmorfopoulos
GSGeorgios Stamoulis
Georgios Stamoulis

1 October 2015
Verified
Conference Paper
Open access
PDF file
POPanagiotis Oikonomou
Panagiotis Oikonomou
Thanasis LoukopoulosThanasis Loukopoulos
Thanasis Loukopoulos
ADAntonios Dadaliaris
Antonios Dadaliaris
MKMaria Koziri
Maria Koziri
GSGeorgios I. Stamoulis
Georgios I. Stamoulis

23 September 2023
Verified
Book Chapter
Closed access
PDF file
SCSteven Chaplick
Steven Chaplick
SKSteven Kelk
Steven Kelk
RMRuben Meuwese
Ruben Meuwese
MMMatúš Mihalák
Matúš Mihalák
GSGeorgios Stamoulis
Georgios Stamoulis