A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees

DOI10.1007/11940128_12zbMath1135.68639OpenAlexW1604266221MaRDI QIDQ5459106

Weizhao Wang, Minoru Kanehisa, Kiyoko F. Aoki-Kinoshita, Ming-Yang Kao, Xiang-Yang Li

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_12

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (2)

Complexity of splits reconstruction for low-degree trees ⋮ Complexity of Splits Reconstruction for Low-Degree Trees

This page was built for publication: A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees