Longest common substring for random subshifts of finite type
DOI10.1214/20-AIHP1130zbMath1492.37016arXiv1905.08131OpenAlexW3184379783MaRDI QIDQ2077341
Publication date: 25 February 2022
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.08131
random dynamical systemsstring matchingrandom environmentslongest common substringrandom sequenceRényi entropy
Strong limit theorems (60F15) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Processes in random environments (60K37) Symbolic dynamics (37B10) General theory of random and stochastic dynamical systems (37H05) Multidimensional shifts of finite type (37B51)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exponential law for random subshifts of finite type
- Matching with shift for one-dimensional Gibbs measures
- Hitting times and periodicity in random dynamics
- Thermodynamic formalism for random countable Markov shifts
- Critical phenomena in sequence matching
- An Erdős-Rényi law with shifts
- An extreme value theory for sequence matching
- Maximal length of common words among random letter sequences
- String matching: The ergodic case
- The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
- A phase transition for the score in matching random sequences allowing deletions
- On the shortest distance between orbits and the longest common substring problem
- Critical phenomena for sequence matching with scoring
- Matching strings in encoded sequences
- Extreme value laws for non stationary processes generated by sequential and random dynamical systems
- Quantitative multiple pointwise convergence and effective multiple correlations
- On Compound Poisson Approximation for Sequence Matching
- The pressure and higher correlations for an Anosov diffeomorphism
- Hitting time statistics for observations of dynamical systems
- Return times at periodic points in random dynamics
- Rényi Entropies and Large Deviations for the First Match Function
- Coupling methods for random topological Markov chains
- Poincaré recurrence for observations
- THERMODYNAMIC FORMALISM FOR RANDOM TRANSFORMATIONS REVISITED
- Poisson approximation for search of rare words in DNA sequences
- A suboptimal lossy data compression based on approximate pattern matching
- Limit theorems for random transformations and processes in random environments
- Nonparametric entropy estimation for stationary processes and random fields, with applications to English text
- Maximal Repetition and Zero Entropy Rate
- A Phase Transition for the Distribution of Matching Blocks
- Ruelle's transfer operator for random subshifts of finite type
- From the divergence between two measures to the shortest path between two observables
- The Rényi entropy function and the large deviation of short return times
- Computation and Estimation of Generalized Entropy Rates for Denumerable Markov Chains
- Conservativity of random Markov fibred systems
This page was built for publication: Longest common substring for random subshifts of finite type
