Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver

Vladimir Ulyantsev, Mikhail Melnik. Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver. In Adrian Horia Dediu, Francisco Hernández Quiroz, Carlos Martín-Vide, David A. Rosenblueth, editors, Algorithms for Computational Biology - Second International Conference, AlCoB 2015, Mexico City, Mexico, August 4-5, 2015, Proceedings. Volume 9199 of Lecture Notes in Computer Science, pages 141-153, Springer, 2015. [doi]

@inproceedings{UlyantsevM15,
  title = {Constructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver},
  author = {Vladimir Ulyantsev and Mikhail Melnik},
  year = {2015},
  doi = {10.1007/978-3-319-21233-3_11},
  url = {http://dx.doi.org/10.1007/978-3-319-21233-3_11},
  researchr = {https://researchr.org/publication/UlyantsevM15},
  cites = {0},
  citedby = {0},
  pages = {141-153},
  booktitle = {Algorithms for Computational Biology - Second International Conference, AlCoB 2015, Mexico City, Mexico, August 4-5, 2015, Proceedings},
  editor = {Adrian Horia Dediu and Francisco Hernández Quiroz and Carlos Martín-Vide and David A. Rosenblueth},
  volume = {9199},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-21232-6},
}