Heuristic Algorithms for the Maximum Colorful Subtree Problem

DOI10.4230/LIPIcs.WABI.2018.23zbMath1494.92050arXiv1801.07456OpenAlexW2963677550MaRDI QIDQ5090364

W. T. J. White, Marie A. Lataretu, Kai Dührkop, Sebastian Böcker

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1801.07456

zbMATH Keywords

fragmentation treescomputational mass spectrometry

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Complexity issues in vertex-colored graph pattern matching
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Fragmentation Trees Reloaded
• Algorithmic Aspects of the Maximum Colorful Arborescence Problem
• Speedy Colorful Subtrees

This page was built for publication: Heuristic Algorithms for the Maximum Colorful Subtree Problem