K. Huber

Polyploidy Arithmetic

This paper shows that finding the smallest number of hybridization events to explain a ploidy profile, or the hybrid number, is equivalent to solving the so-called addition sequence problem, and provides a greedy polynomial-time algorithm to decide whether a given profile can be realized by such a network.