Publication no #2646   Type :   Html | Bib | Both
Created: 2017-10-31 22:19:15     Modified: 2018-08-13 07:31:40
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, 2018.  
Keywords: APX hard, from network, from sequences, likelihood, NP complete, parsimony.
Note:, to appear.