Publication no #2646   Type :   Html | Bib | Both
Created: 2017-10-31 22:19:15     Modified: 2020-09-12 09:11:09
2646
photophotophotophoto
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.