![photo](http://phylnet.univ-mlv.fr/photos/PhotoKelkSteven.jpg) ![photo](http://phylnet.univ-mlv.fr/photos/PhotoPardiFabio.jpg) ![photo](http://phylnet.univ-mlv.fr/photos/PhotoScornavaccaCeline.jpg) ![photo](http://phylnet.univ-mlv.fr/photos/PhotoIerselLeo.jpg)
Steven Kelk,
Fabio Pardi,
Celine Scornavacca and
Leo van Iersel. Finding the most parsimonious or likely tree in a network with respect to an alignment. In JOMB, Vol. 78:527-547, 2019. Keywords: APX hard, from network, from sequences, likelihood, NP complete, parsimony. Note: https://arxiv.org/abs/1707.03648.
|