Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. van Iersel, L., Kelk, S., Lekic, N., & Linz, S. Theor. Comput. Sci., 609:1-21, 2016.
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. [link]Link  Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. [link]Paper  bibtex   
@article{journals/tcs/IerselKLL16,
  added-at = {2015-12-05T00:00:00.000+0100},
  author = {van Iersel, Leo and Kelk, Steven and Lekic, Nela and Linz, Simone},
  biburl = {http://www.bibsonomy.org/bibtex/2af14db13af7f5eb48361220392928e9b/dblp},
  ee = {http://dx.doi.org/10.1016/j.tcs.2015.06.021},
  interhash = {4275a5f8047b1bca4355e3763aa92e62},
  intrahash = {af14db13af7f5eb48361220392928e9b},
  journal = {Theor. Comput. Sci.},
  keywords = {dblp},
  pages = {1-21},
  timestamp = {2015-12-10T11:44:57.000+0100},
  title = {Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees.},
  url = {http://dblp.uni-trier.de/db/journals/tcs/tcs609.html#IerselKLL16},
  volume = 609,
  year = 2016
}

Downloads: 0