Pages that link to "Item:Q3757093"
From MaRDI portal
The following pages link to Counts of long aligned word matches among random letter sequences (Q3757093):
Displaying 15 items.
- On coincidences of tuples in a binary tree with random labels of vertices (Q314211) (← links)
- On the height of digital trees and related problems (Q922689) (← links)
- Maximal success durations for a semi-Markov process (Q1094005) (← links)
- Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons (Q1194425) (← links)
- Pattern matching between two non-aligned random sequences (Q1340810) (← links)
- Matching among multiple random sequences (Q1363031) (← links)
- Limit distributions of extremal distances to the nearest neighbor (Q1669575) (← links)
- On coincidences of tuples in a \(q\)-ary tree with random labels of vertices (Q1741460) (← links)
- Shortest distance between multiple orbits and generalized fractal dimensions (Q2035433) (← links)
- Generic properties of subgroups of free groups and finite presentations (Q2975245) (← links)
- Compound Poisson approximation of word counts in DNA sequences (Q3127360) (← links)
- A Phase Transition for the Distribution of Matching Blocks (Q4715263) (← links)
- A Probabilistic Analysis of a String Editing Problem and its Variations (Q4852430) (← links)
- Об асимптотической нормальности в задаче о повторениях цепочек в помеченном полном дереве (Q5071483) (← links)
- Improvements on the distribution of maximal segmental scores in a Markovian sequence (Q5109488) (← links)
