Abstract
A node-labeled rooted tree T (with root r) is an all-or-nothing subtree (called AoN-subtree) of a node-labeled rooted tree T′ if (1) T is a subtree of the tree rooted at some node u (with the same label as r) of T′, (2) for each internal node v of T, all the neighbors of v in T′ are the neighbors of v in T. Tree T′ is then called an AoN-supertree of T. Given a set \({\mathcal {T}}=\{{T}_1,{T}_2,\cdots, {T}_n\}\) of nnode-labeled rooted trees, smallest common AoN-supertree problem seeks the smallest possible node-labeled rooted tree (denoted as \({\textbf{LCST}}\)) such that every tree T i in \({\mathcal {T}}\) is an AoN-subtree of \({\textbf{LCST}}\). It generalizes the smallest superstring problem and it has applications in glycobiology. We present a polynomial-time greedy algorithm with approximation ratio 6.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Turner, J.S.: Approximation algorithms for the shortest common superstring problem. Information and Computation, 1–20 (1989)
Teng, S., Yao, F.: Approximating shortest superstrings. In: Annual Symposium on Foundations of Computer Science (1993)
Weinard, M., Schnitger, G.: On the greedy superstring conjecture. In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, pp. 387–398 (2003)
Kaplan, H., Shafrir, N.: The greedy algorithm for shortest superstrings. Inf. Process. Lett. 93, 13–17 (2005)
Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstrings. Journal of the ACM 41, 630–647 (1994)
Sweedyk, Z.: A \(2\frac{1}{2}\)-approximation algorithm for shortest superstring. SIAM Journal of Computing 29, 954–986 (1999)
Armen, C., Stein, C.: A 2 2/3-approximation algorithm for the shortest superstring problem. Combinatorial Pattern Matching, 87–101 (1996)
Hashimoto, K., Goto, S., Kawano, S., Aoki-Kinoshita, K., Ueda, N., Hamajima, M., Kawasaki, T., Kanehisa, M.: Kegg as a glycome informatics resource. Glycobiology (2005)
Aoki, K., Yamaguchi, A., Ueda, N., Akutsu, T., Mamitsuka, H., Goto, S., Kanehisa, M.: Kcam (kegg carbohydrate matcher): A software tool for analyzing the structures of carbohydrate sugar chains. Nucleic Acids Research, W267–W272 (2004)
Aoki, K., Yamaguchi, A., Okuno, Y., Akutsu, T., Ueda, N., Kanehisa, M., Mamitsuka, H.: Efficient tree-matching methods for accurate carbohydrate database queries. In: Proceedings of the Fourteenth International Conference on Genome Informatics (Genome Informatics, 14), pp. 134–143. Universal Academy Press (2003)
Aoki, K.F., Mamitsuka, H., Akutsu, T., Kanehisa, M.: A score matrix to reveal the hidden links in glycans. Bioinformatics 8, 1457–1463 (2005)
Ueda, N., Aoki-Kinoshita, K.F., Yamaguchi, A., Akutsu, T., Mamitsuka, H.: A probabilistic model for mining labeled ordered trees: capturing patterns in carbohydrate sugar chains. IEEE Transactions on Knowledge and Data Engineering 17, 1051–1064 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aoki-Kinoshita, K.F., Kanehisa, M., Kao, MY., Li, XY., Wang, W. (2006). A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_12
Download citation
DOI: https://doi.org/10.1007/11940128_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)