On the probability of existence of substrings with the same structure in a random sequence

DOI10.1515/DMA-2017-0038MaRDI QIDQ1744334zbMATH OpenOpenAlexFDO

Authors Vladimir G. Mikhailov

Publication date 23 April 2018

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2017-0038

zbMATH Keywords

equivalent substringsMarkov chainpolynomial schemestructure of substring

Mathematics Subject Classification ID

Combinatorial probability (60C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence
• scientific article; zbMATH DE number 3998861
• Common Substrings in Random Strings
• Bounds for the probability of a constrained embedding of one discrete sequence into another
• scientific article; zbMATH DE number 3963627

Cites work

• Compound Poisson approximation for multiple runs in a Markov chain
• Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain
• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• scientific article; zbMATH DE number 722978 (Why is no real title available?)
• Matchings up to permutations in sequences of independent trials
• On multiple repetitions of long tuples in a Markov chain
• On repetitions of long tuples in a Markov chain
• On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence
• On the numbers of equivalent tuples sets in a sequence of independent random variables
• Structural equivalence of s-tuples in random discrete sequences

Cited in

(10)

• Limit distributions of extremal distances to the nearest neighbor
• On coincidences of tuples in a \(q\)-ary tree with random labels of vertices
• On the reduction property of the number of \(H\)-equivalent tuples of states in a discrete Markov chain
• Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
• scientific article; zbMATH DE number 434722 (Why is no real title available?)
• On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence
• Expected Number of Distinct Subsequences in Randomly Generated Binary Strings
• Markovian embeddings of general random strings
• Common Substrings in Random Strings
• Bounds for the probability of a constrained embedding of one discrete sequence into another

This page was built for publication: On the probability of existence of substrings with the same structure in a random sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744334)