Abstract
We present polynomial-time approximation algorithms for string folding problems over any finite alphabet. Our idea is the following: describe a class of feasible solutions by means of an ambiguous context-free grammar (i.e. there is a bijection between the set of parse trees and a subset of possible embeddings of the string); give a score to every production of the grammar, so that the total score of every parse tree (the sum of the scores of the productions of the tree) equals the score of the corresponding structure; apply a parsing algorithm to find the parse tree with the highest score, corresponding to the configuration with highest score among those generated by the grammar. Furthermore, we show how the same approach can be extended in order to deal with an infinite alphabet or different goal functions. In each case, we prove that our algorithm guarantees a performance ratio that depends on the size of the alphabet or, in case of an infinite alphabet, on the length of the input string, both for the two and three-dimensional problem. Finally, we show some experimental results for the algorithm, comparing it to other performance-guaranteed approximation algorithms.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
K.A. Dill, Dominant forces in protein folding. Biochemistry, 24 (1985), 1501.
B. Hayes, Prototeins. American Scientist, 3(1998), 86.
M. Paterson, T. Przytycka, On the Complexity of String Folding. Discrete and Applied Maths, 71 (1996), 217–230.
P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, M. Yannakakis, On the Complexity of Protein Folding. Proc. of the Second Annual International Conference on Computational Biology (RECOMB’ 98), 61–62, New York, 1998.
B. Berger, T. Leighton, Protein Folding in the HP Model is NP Complete. Proc. of the Second Annual International Conference on Computational Biology (RECOMB’ 98), 30–39, New York, 1998.
A. Nayak, A. Sinclair, U. Zwick, Spatial Codes and the Hardness of String Folding Problems. Proceedings of the 9 th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’ 98), 639–648, San Francisco, 1998.
W.E. Hart, S.C. Istrail, Fast Protein Folding in the Hydrophobic-Hydrophilic Model. Journal of computational biology, 3(1), 53–96, 1996.
G. Mauri, G. Pavesi, A. Piccolboni, Approximation Algorithms for Protein Folding Prediction. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’ 99), S945–S946, Baltimore, 1999.
J. Earley, An Efficient Context-Free Parsing Algorithm. Communications of the ACM, 6 (1970), 451–455.
A. Stölcke, An Efficient Probabilistic Context-Free Parsing Algorithm That Computes Prefix Probabilities. Computational Linguistics, 21(2), 165–201, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mauri, G., Pavesi, G. (2000). Approximation Algorithms for String Folding Problems. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds) Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics. TCS 2000. Lecture Notes in Computer Science, vol 1872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44929-9_4
Download citation
DOI: https://doi.org/10.1007/3-540-44929-9_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67823-6
Online ISBN: 978-3-540-44929-4
eBook Packages: Springer Book Archive