@InProceedings{duhrkop_et_al:LIPIcs.WABI.2018.23,
  author =	{D\"{u}hrkop, Kai and Lataretu, Marie A. and White, W. Timothy J. and B\"{o}cker, Sebastian},
  title =	{{Heuristic Algorithms for the Maximum Colorful Subtree Problem}},
  booktitle =	{18th International Workshop on Algorithms in Bioinformatics (WABI 2018)},
  pages =	{23:1--23:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-082-8},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{113},
  editor =	{Parida, Laxmi and Ukkonen, Esko},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2018.23},
  URN =		{urn:nbn:de:0030-drops-93256},
  doi =		{10.4230/LIPIcs.WABI.2018.23},
  annote =	{Keywords: Fragmentation trees, Computational mass spectrometry}
}