The following pages link to Heinrich Matzinger (Q1872359):
Displaying 44 items.
- (Q287833) (redirect page) (← links)
- Closeness to the diagonal for longest common subsequences in random words (Q287834) (← links)
- On the variance of the optimal alignments score for binary random words and an asymmetric scoring function (Q330635) (← links)
- Optimal alignments of longest common subsequences and their path properties (Q396006) (← links)
- The rate of the convergence of the mean score in random sequence comparison (Q433905) (← links)
- DNA approach to scenery reconstruction (Q719766) (← links)
- Reconstruction of periodic sceneries seen along a random walk (Q855924) (← links)
- On the longest common increasing binary subsequence (Q857117) (← links)
- Thermodynamical approach to the longest common subsequence problem (Q937112) (← links)
- Information recovery from randomly mixed-up message text (Q1039019) (← links)
- Reconstructing a random scenery observed with random errors along a random walk path (Q1396756) (← links)
- Non-normal limiting distribution for optimal alignment scores of strings in binary alphabets (Q1675349) (← links)
- Lower bounds for moments of global scores of pairwise Markov chains (Q1747794) (← links)
- Reconstructing a multicolor random scenery seen along a random walk path with bounded jumps (Q1767542) (← links)
- Reconstructing a two-color scenery by observing it along a simple random walk path (Q1774198) (← links)
- Scenery reconstruction in two dimensions with many colors (Q1872360) (← links)
- Reconstruction of a multidimensional scenery with a branching random walk (Q2013565) (← links)
- Sparse long blocks and the micro-structure of the longuest common subsequences (Q2249281) (← links)
- Standard deviation of the longest common subsequence (Q2270612) (← links)
- On suboptimal LCS-alignments for independent Bernoulli sequences with asymmetric distributions (Q2276418) (← links)
- Microscopic path structure of optimally aligned random sequences (Q2278651) (← links)
- An upper bound on the convergence rate of a second functional in optimal sequence alignment (Q2405209) (← links)
- Letter change bias and local uniqueness in optimal sequence alignments (Q2440343) (← links)
- Detecting a local perturbation in a continuous scenery (Q2461984) (← links)
- Approximation to the mean curve in the LCS problem (Q2476294) (← links)
- Markers for error-corrupted observations (Q2495384) (← links)
- Retrieving random media (Q2509002) (← links)
- Reconstruction of sceneries with correlated colors. (Q2574568) (← links)
- Reconstructing a piece of scenery with polynomially many observations. (Q2574598) (← links)
- Information recovery from observations by a random walk having jump distribution with exponential tails (Q2811804) (← links)
- Proportion of Gaps and Fluctuations of the Optimal Score in Random Sequence Comparison (Q2848106) (← links)
- Recognition of times a walker is close to the origin (Q2863799) (← links)
- CLT for the proportion of infected incividuals for an epidemic model on a complete graph (Q3099230) (← links)
- Finding blocks and other patterns in a random coloring of ℤ (Q3376663) (← links)
- (Q3412988) (← links)
- (Q4265789) (← links)
- Compact Elements and Smallest Faithful Representation of C ∗ -Algebras (Q4874191) (← links)
- Quantifying the estimation error of principal component vectors (Q5006534) (← links)
- A Monte Carlo Approach to the Fluctuation Problem in Optimal Alignments of Random Strings (Q5168340) (← links)
- (Q5376122) (← links)
- Large deviations-based upper bounds on the expected relative length of longest common subsequences (Q5395363) (← links)
- (Q5422645) (← links)
- Macroscopic non-uniqueness and transversal fluctuation in optimal random sequence alignment (Q5429605) (← links)
- Analytical formula for large eigenvalues of sample covariance matrix in infinite dimensional case (Q6540489) (← links)
