A Phase Transition for the Distribution of Matching Blocks
From MaRDI portal
DOI10.1017/S0963548300001930zbMATH Open0865.60027MaRDI QIDQ4715263FDOQ4715263
Authors: Claudia Neuhauser 
Publication date: 7 July 1997
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 850337
- Counts of long aligned word matches among random letter sequences
- Critical phenomena in sequence matching
- Long match patterns in random sequences
- Estimate of the Accuracy of the Compound Poisson Approximation for the Distribution of the Number of Matching Patterns
Cites Work
- Probability approximations via the Poisson clumping heuristic
- Two moments suffice for Poisson approximations: The Chen-Stein method
- On a new law of large numbers
- Title not available (Why is that?)
- Poisson approximation for dependent trials
- Counts of long aligned word matches among random letter sequences
- The Erdős-Rényi law in distribution, for coin tossing and sequence matching
- New approaches for computer analysis of nucleic acid sequences.
- How many random digits are required until given sequences are obtained?
- Critical phenomena in sequence matching
- An extreme value theory for sequence matching
- A limit theorem for the number of non-overlapping occurrences of a pattern in a sequence of independent trials
Cited In (13)
- Critical phenomena in sequence matching
- Compound Poisson approximation: A user's guide
- Rényi entropy and pattern matching for run-length encoded sequences
- On compound Poisson approximation for sequence matching
- Title not available (Why is that?)
- Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models
- Matching of observations of dynamical systems, with applications to sequence matching
- The Erdős-Rényi strong law for pattern matching with a given proportion of mismatches
- Compound Poisson process approximation.
- The planted matching problem: phase transitions and exact results
- Longest common substring for random subshifts of finite type
- On the shortest distance between orbits and the longest common substring problem
- Matching strings in encoded sequences
This page was built for publication: A Phase Transition for the Distribution of Matching Blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4715263)
