Abstract
We present an efficient generalization of algebraic dynamic programming (ADP) to unordered data types and a formalism for the automated derivation of outside grammars from their inside progenitors. These theoretical contributions are illustrated by ADP-style algorithms for shortest Hamiltonian path problems. These arise naturally when asking whether the evolutionary history of an ancient gene cluster can be explained by a series of local tandem duplications. Our framework makes it easy to compute Maximum accuracy solutions, which in turn require the computation of the probabilities of individual edges in the ensemble of Hamiltonian paths. The expansion of the Hox gene clusters is investigated as a show-case application. For implementation details see http://www.bioinf.uni-leipzig.de/Software/setgram/
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Giegerich, R., Meyer, C.: Algebraic dynamic programming. In: Kirchner, H., Ringeissen, C. (eds.) AMAST 2002. LNCS, vol. 2422, pp. 349–364. Springer, Heidelberg (2002)
Höner zu Siederdissen, C.: Sneaking around concatMap: efficient combinators for dynamic programming. In: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming, ICFP 2012, pp. 215–226. ACM (2012)
Sauthoff, G., Janssen, S., Giegerich, R.: Bellman’s GAP - A Declarative Language for Dynamic Programming. In: Proceedings of the 13th international ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming, PPDP 2011, pp. 29–40. ACM (2011)
Höner zu Siederdissen, C., Hofacker, I.L., Stadler, P.F.: Product Grammars for Alignment and Folding. IEEE/ACM Trans. Comp. Biol. Bioinf. 99 (2014)
Giegerich, R., Touzet, H.: Modeling Dynamic Programming Problems over Sequences and Trees with Inverse Coupled Rewrite Systems. Algorithms, 62–144 (2014)
Höner zu Siederdissen, C., Hofacker, I.L.: Discriminatory power of RNA family models. Bioinformatics 26(18), 453–459 (2010)
Voß, B., Giegerich, R., Rehmsmeier, M.: Complete probabilistic analysis of RNA shapes. BMC Biology 4(1), 5 (2006)
Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9, 61–63 (1962)
Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. SIAM 10, 196–201 (1962)
McCaskill, J.S.: The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers 29, 1105–1119 (1990)
Janssen, S.: Kisses, ambivalent models and more: Contributions to the analysis of RNA secondary structure. PhD thesis, Univ. Bielefeld (2014)
Elemento, O., Gascuel, O.: An efficient and accurate distance based algorithm to reconstruct tandem duplication trees. Bioinformatics 8(suppl. 2), S92–S99 (2002)
Cameron, R.A., Rowen, L., Nesbitt, R., Bloom, S., Rast, J.P., Berney, K., Arenas-Mena, C., Martinez, P., Lucas, S., Richardson, P.M., Davidson, E.H., Peterson, K.J., Hood, L.: Unusual gene order and organization of the sea urchin Hox cluster. J. Exp. Zoolog. B Mol. Dev. Evol. 306, 45–58 (2006)
Höner zu Siederdissen, C., Hofacker, I.L., Stadler, P.F.: How to multiply dynamic programming algorithms. In: Setubal, J.C., Almeida, N.F. (eds.) BSB 2013. LNCS, vol. 8213, pp. 82–93. Springer, Heidelberg (2013)
McBride, C.: Clowns to the left of me, jokers to the right (pearl): dissecting data structures. In: ACM SIGPLAN Notices, vol. 43, pp. 287–295. ACM (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Höner zu Siederdissen, C., Prohaska, S.J., Stadler, P.F. (2014). Dynamic Programming for Set Data Types. In: Campos, S. (eds) Advances in Bioinformatics and Computational Biology. BSB 2014. Lecture Notes in Computer Science(), vol 8826. Springer, Cham. https://doi.org/10.1007/978-3-319-12418-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-12418-6_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12417-9
Online ISBN: 978-3-319-12418-6
eBook Packages: Computer ScienceComputer Science (R0)