Publications (5)
Closeness to the Diagonal for Longest Common Subsequences in Random Words
C. Houdré, H. Matzinger
The nature of the alignment with gaps corresponding to a longest common subsequence (LCS) of two independent iid random sequences drawn from a finite alphabet is investigated. It i…
Fluctuations of the Longest Common Subsequence in the Asymmetric Case of 2- and 3-Letter Alphabets
F. Bonetto, H. Matzinger
We investigate the asymptotic standard deviation of the Longest Common Subsequence (LCS) of two independent i.i.d. sequences of length n. The first sequence is drawn from a three l…
Sparse long blocks and the variance of the longest common subsequences in random words
S. Amsalu, C. Houdré, H. Matzinger
Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest…
CLT for the proportion of infected incividuals for an epidemic model on a complete graph
F. Machado, H. Mashurian, H. Matzinger
We prove a Central Limit Theorem for the proportion of infected individuals for an epidemic model by dealing with a discrete time system of simple random walks on a complete graph…
Sparse Long Blocks and the Micro-Structure of the Longest Common Subsequences
S. Amsalu, C. Houdré, H. Matzinger
Consider two random strings having the same length and generated by an iid sequence taking its values uniformly in a fixed finite alphabet. Artificially place a long constant block…