Simone Linz

Has grant

Associate Professor

University of Auckland

New Zealand

Research Interests

Explore related searches

Professors in New Zealand

About

Dr. Simone Linz is an Associate Professor at the University of Auckland, New Zealand. Her research focuses on phylogenetics, specifically in the areas of phylogenetic trees and networks, hybrid numbers, and parsimony scores. Recent articles include explorations in tree bisection, Hamilton cycles, and the development of QUBO formulations related to phylogenetic problems.

Recent Grants

Grant: Close

Parameterized algorithms for hard problems on phylogenetic networks

Open Date: 2022-07-01

Close Date: 2024-06-01

Grant: Close

Relentlessly complex? New algorithmic foundations to analyze complex evolution

Open Date: 2022-01-01

Close Date: 2025-01-01

Grant: Close

Lost in space? New mathematical tools to analyse and search spaces of phylogenetic networks

Open Date: 2015-07-01

Close Date: 2018-07-01

Grant: Close

New Algorithmic and Mathematical Tools to Construct a Net of Life

Open Date: 2012-05-01

Close Date: 2015-04-30

Articles (16)

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Year:

2021

Year:

2021

Year:

2020

Year:

2020

Collaborators (1)

Charles Semple

Professor

University of Canterbury

NEW ZEALAND

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Simone Linz

Research Interests

Explore related searches

About

Recent Grants

Articles (16)

Cherry picking in forests: A new characterization for the unrooted hybrid number of two phylogenetic trees

On the existence of funneled orientations for classes of rooted phylogenetic networks

Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks

Bounding the Softwired Parsimony Score of a Phylogenetic Network

Deep kernelization for the Tree Bisection and Reconnection (TBR) distance in phylogenetics

Phylogenetic Trees Defined by at Most Three Characters

Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance

Exploring spaces of semi-directed level-1 networks

A QUBO formulation for the Tree Containment problem

Non-essential arcs in phylogenetic networks

On the Maximum Agreement Subtree Conjecture for Balanced Trees

Reflections on kernelizing and computing unrooted agreement forests

Display sets of normal and tree-child networks

The rigid hybrid number for two phylogenetic trees

Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443)

Caterpillars on three and four leaves are sufficient to reconstruct binary normal networks

Collaborators (1)

Charles Semple

Make your next move.