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.
       


@Article{KPSI2019,
      AUTHOR = {Kelk, Steven and Pardi, Fabio and Scornavacca, Celine and van Iersel, Leo},
      TITLE = {Finding the most parsimonious or likely tree in a network with respect to an alignment},
      YEAR = {2019},
      JOURNAL = {JOMB},
      VOLUME = {78},
      PAGES = {527-547},
      URL = {http://dx.doi.org/10.1007/s00285-018-1282-2},
      NOTE = {https://arxiv.org/abs/1707.03648},
      KEYWORDS = {APX hard, from network, from sequences, likelihood, NP complete, parsimony}
}