Pages that link to "Item:Q1263898"
From MaRDI portal
The following pages link to The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches (Q1263898):
Displaying 20 items.
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- The Erdős-Rényi law in distribution, for coin tossing and sequence matching (Q749471) (← links)
- Critical phenomena in sequence matching (Q1064665) (← links)
- An Erdős-Rényi law with shifts (Q1071378) (← links)
- Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons (Q1194425) (← links)
- Erdős-Rényi laws for Gibbs measures (Q1328204) (← links)
- String matching bounds via coding (Q1356344) (← links)
- The Hausdorff dimension of level sets described by Erdős-Rényi average (Q1674400) (← links)
- On the shortest distance between orbits and the longest common substring problem (Q1710399) (← links)
- A generalization of the Erdős-Rényi limit theorem and the corresponding multifractal analysis (Q1786701) (← links)
- Optimal data compression algorithm (Q1816650) (← links)
- Longest common substring for random subshifts of finite type (Q2077341) (← links)
- Duality between the local score of one sequence and constrained hidden Markov model (Q2157385) (← links)
- Languages with mismatches (Q2456367) (← links)
- Adaptive multiscale detection of filamentary structures in a background of uniform random points (Q2493555) (← links)
- Non-parametric change-point estimation using string matching algorithms (Q2513665) (← links)
- Testing Stream Ciphers by Finding the Longest Substring of a Given Density (Q3634488) (← links)
- A Probabilistic Analysis of a String Editing Problem and its Variations (Q4852430) (← links)
- Large deviations-based upper bounds on the expected relative length of longest common subsequences (Q5395363) (← links)
- Universal Data Compression Algorithm Based on Approximate String Matching (Q5485382) (← links)
