Abstract
Computing the duplication history of a tandem repeated region is an important problem in computational biology (Fitch in Genetics 86:623–644, 1977; Jaitly et al. in J. Comput. Syst. Sci. 65:494–507, 2002; Tang et al. in J. Comput. Biol. 9:429–446, 2002). In this paper, we design a polynomial-time approximation scheme (PTAS) for the case where the size of the duplication block is 1. Our PTAS is faster than the previously best PTAS in Jaitly et al. (J. Comput. Syst. Sci. 65:494–507, 2002). For example, to achieve a ratio of 1.5, our PTAS takes O(n 5) time while the PTAS in Jaitly et al. (J. Comput. Syst. Sci. 65:494–507, 2002) takes O(n 11) time. We also design a ratio-6 polynomial-time approximation algorithm for the case where the size of each duplication block is at most 2. This is the first polynomial-time approximation algorithm with a guaranteed ratio for this case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Benson, G., Dong, L.: Reconstructing the duplication history of a tandem repeat. In: Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology (ISMB-99), pp. 44–53 (1999)
Fitch, W.: Phylogenies constrained by cross-over process as illustrated by human hemoglobins in a thirteen cycle, eleven amino-acid repeat in human apolipoprotein A-I. Genetics 86, 623–644 (1977)
Jaitly, D., Kearney, P.E., Lin, G., Ma, B.: Methods for reconstructing the history of tandem repeats and their application to the human genome. J. Comput. Syst. Sci. 65, 494–507 (2002)
Lillo, F., Basile, S., Mantegna, R.N.: Comparative genomics study of inverted repeats in bacteria. Bioinformatics 18, 971–979 (2002)
Macas, J., Mszros, T., Nouzov, M.: PlantSat: a specialized database for plant satellite repeats. Bioinformatics 18, 28–35 (2002)
Otu, H.H., Sayood, K.: A new sequence distance measure for phylogenetic tree construction. Bioinformatics 19, 2122–2130 (2004)
Tang, M., Waterman, M.S., Yooseph, S.: Zinc finger gene clusters and tandem gene duplication. J. Comput. Biol. 9, 429–446 (2002)
Wang, L., Jiang, T., Lawler, E.L.: Approximation algorithms for tree alignment with a given phylogeny. Algorithmica 16, 302–315 (1996)
Zhang, L., Ma, B., Wang, L., Xu, Y.: Greedy method for inferring tandem duplication history. Bioinformatics 19, 1497–1504 (2003)
Author information
Authors and Affiliations
Corresponding author
Additional information
Part of work was done during a Z.-Z. Chen visit at City University of Hong Kong.
Rights and permissions
About this article
Cite this article
Chen, ZZ., Wang, L. & Wang, Z. Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats. Algorithmica 54, 501–529 (2009). https://doi.org/10.1007/s00453-008-9209-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-008-9209-8