Matching strings in encoded sequences
From MaRDI portal
Publication:2174991
DOI10.3150/19-BEJ1181zbMath1442.94028arXiv1903.09625MaRDI QIDQ2174991
Jérôme Rousseau, Rodrigo Lambert, Adriana Coutinho
Publication date: 27 April 2020
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.09625
Strong limit theorems (60F15) Entropy and other invariants (28D20) Generation, random and stochastic difference and differential equations (37H10) Measures of information, entropy (94A17) Symbolic dynamics (37B10)
Related Items (4)
R\'enyi entropy and pattern matching for run-length encoded sequences ⋮ Shortest distance between multiple orbits and generalized fractal dimensions ⋮ Longest common substring for random subshifts of finite type ⋮ Matching of observations of dynamical systems, with applications to sequence matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recurrence for random dynamical systems
- Stochastically perturbed chains of variable memory
- Large deviations for short recurrence
- Random perturbations of stochastic processes with unbounded variable length memory
- An Erdős-Rényi law with shifts
- The asymptotics of waiting times between stationary processes, allowing distortion
- On the spectra of randomly perturbed expanding maps
- Quantitative recurrence results
- More on recurrence and waiting times
- Recurrence, dimensions, and Lyapunov exponents.
- On the shortest distance between orbits and the longest common substring problem
- Pointwise dimensions for Poincaré recurrences associated with maps and special flows
- Critical phenomena for sequence matching with scoring
- Limit distribution of maximal non-aligned two-sequence segmental score
- Longest common substring for random subshifts of finite type
- Recurrence rate in rapidly mixing dynamical systems
- On Compound Poisson Approximation for Sequence Matching
- Hitting time statistics for observations of dynamical systems
- Laws of rare events for deterministic and random dynamical systems
- Rényi Entropies and Large Deviations for the First Match Function
- Poincaré recurrence for observations
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- Return times in a process generated by a typical partition
- Exponential decay of correlations for randomly chosen hyperbolic toral automorphisms
- AN INTRODUCTION TO QUANTITATIVE POINCARÉ RECURRENCE IN DYNAMICAL SYSTEMS
- Stochastic scrabble: large deviations for sequences with scores
- Entropy and data compression schemes
- A suboptimal lossy data compression based on approximate pattern matching
- Nonparametric entropy estimation for stationary processes and random fields, with applications to English text
- The Shortest Possible Return Time of <inline-formula> <tex-math notation="LaTeX">$\beta$ </tex-math> </inline-formula>-Mixing Processes
- A Phase Transition for the Distribution of Matching Blocks
- The distribution of the short-return function
- 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
- Entry and return times distribution
This page was built for publication: Matching strings in encoded sequences
