activity
20042025
most citedStandard deviation of the longest common subsequence

24 citations · 91 across the 27 of their papers we have counts for

collaborators
Showing 2012Show all

6 papers · 1 filter

math.PR2012★ 1 cited

Distribution of Aligned Letter Pairs in Optimal Alignments of Random Sequences

Raphael Hauser, Heinrich Matzinger

Considering the optimal alignment of two i.i.d. random sequences of length , we show that when the scoring function is chosen randomly, almost surely the empirical distribution…

math.PR2012★ 3 cited

A Monte Carlo Approach to the Fluctuation Problem in Optimal Alignments of Random Strings

Saba Amsalu, Raphael Hauser, Heinrich Matzinger

The problem of determining the correct order of fluctuation of the optimal alignment score of two random strings of length has been open for several decades. It is known that t…

math.PR2012★ 4 cited

General approach to the fluctuations problem in random sequence comparison

Jüri Lember, Heinrich Matzinger, Felipe Torres

We present a general approach to the problem of determining the asymptotic order of the variance of the optimal score between two independent random sequences defined over an arbit…

stat.AP2012★ 5 cited

Detecting the homology of DNA-sequences based on the variety of optimal alignments: a case study

Erik Hirmo, Jüri Lember, Heinrich Matzinger

We consider a novel approach of measuring the homology of DNA sequences based of the variety of optimal alignments in the longest common subsequence sense. The proposed approach is…

math.PR2012★ 8 cited

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…

math.PR2012

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…