Probabilities for a Generalized Birthday Problem
From MaRDI portal
Cited in
(22)- Matching rectangles in d-dimensions: Algorithms and laws of large numbers
- The number of dense arrangements
- Distribution of the minimum number of points in a scanning interval on the line
- Pattern matching between two non-aligned random sequences
- An O(n log n) algorithm for the generalized birthday problem
- Runs, scans and urn model distributions: A unified Markov chain approach
- Approximations for discrete scan statistics on the circle
- An efficient algorithm for exact distribution of discrete scan statistics
- Maximum scan score-type statistics
- Discrete scan statistics generated by exchangeable binary trials
- Scan statistic tail probability assessment based on process covariance and window size
- Combined \(m\)-consecutive and \(k\)-out-of-\(n\) sliding window systems
- Sequential Window Problems
- Power of discrete scan statistics: a finite Markov chain imbedding approach
- Multiple window discrete scan statistic for higher-order Markovian sequences
- Discrete, continuous and conditional multiple window scan statistics
- p-values for the discrete scan statistic through slack variables
- Bonferroni-type inequalities for conditional scan statistics
- New recursive methods for scan statistic probabilities
- Uneven allocation of elements in linear multi-state sliding window system
- Matching probability between two aligned Markov dependent nucleic acid sequences while allowing d mutations. In honour of Joseph Glaz for his distinguished career and profound contributions to the field of applied probability and statistics
- Measures for the exceptionality of gene order in conserved genomic regions
This page was built for publication: Probabilities for a Generalized Birthday Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4043840)
