Members

Jesper obtained his Ph.D degree from Lund University in Sweden in 2003. He enjoys traveling and he has visited about 19% of the countries in the world so far. Jesper is currently developing mathematical theories and algorithms for solving various (old and new) combinatorial problems, with a focus on computational complexity. His goal is to design conceptually simple, efficient, and flexible methods for manipulating and comparing graphs that may be useful in many different situations. He is especially interested in combinatorial problems from the biological sciences that can be expressed elegantly using graphs and tree structures. As an example, biologists have used so-called “phylogenetic trees” for more than 150 years to describe divergent evolutionary history among species and many efficient techniques for constructing such trees exist, but how does one construct a “phylogenetic network” that can represent non-treelike evolutionary history in cases where the traditional tree model is insufficient?