On the Variance of the Optimal Alignments Score for Binary Random Words and an Asymmetric Scoring Function
We investigate the order of the variance of the optimal alignments (OA) score of two independent iid binary random words having the same length. The letters are equiprobable, but the scoring function is such that one letter has a larger score than the other. In this setting, we prove that the order of variance is linear in the common length. OAs constitute a generalization of longest common subsequences, they can be represented as optimal paths in a two-dimensional last passage percolation setting with dependent weights.
KeywordsOptimal alignments Variance bounds Longest common subsequences Last passage percolation
Mathematics Subject Classification60K35 60C05 05A05
Research supported in part by the Simons Foundation Grant #246283.
- 8.Gong, R., Houdré, C., Işlak, Ü.: A central limit theorem for optimal alignments score in multiple random words. arXiv:1512.05699 (2015)
- 10.Houdré, C., Işlak, Ü.: A central limit theorem for the length of the largest common subsequences in random words. arXiv:1408.1559v3
- 12.Houdré, C., Ma, J.: On the order of the central moments of the length of the largest common subsequences in random words. In: Houdré, C., Mason, D.M., Reynaud-Bouret, P., Rosiński, J. (eds.) High Dimensional Probability VII: The Cargèse Volume, Progress in Probability, Birkhäuser, To appear (2016)Google Scholar
- 15.Krug, J., Spohn, H.: Kinetic Roughening of Growing Surfaces. In Solids Far From Equilibrium, pp. 479–582. Cambridge University Press, Cambridge (1991)Google Scholar
- 20.Robin, S., Rodolphe, F., Schbath, S.: ADN, mots et modèles. Belin, Paris (2003)Google Scholar