Scanning Phylogenetic Networks Is NP-hard. Berry, V., Scornavacca, C., & Weller, M. In SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings, pages 519–530, 2020.
Scanning Phylogenetic Networks Is NP-hard [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/sofsem/BerrySW20,
  author       = {Vincent Berry and
                  C{\'{e}}line Scornavacca and
                  Mathias Weller},
  title        = {Scanning Phylogenetic Networks Is NP-hard},
  booktitle    = {{SOFSEM} 2020: Theory and Practice of Computer Science - 46th International
                  Conference on Current Trends in Theory and Practice of Informatics,
                  {SOFSEM} 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings},
  pages        = {519--530},
  year         = {2020},
  crossref     = {DBLP:conf/sofsem/2020},
  url          = {https://doi.org/10.1007/978-3-030-38919-2\_42},
  doi          = {10.1007/978-3-030-38919-2\_42},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/BerrySW20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0