A probabilistic analysis of a pattern matching problem

DOI10.1002/rsa.3240040206zbMath0768.60009OpenAlexW2105838955MaRDI QIDQ4696228

Wojciech Szpankowski, Mikhail J. Atallah, Philippe Jacquet

Publication date: 29 June 1993

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240040206

zbMATH Keywords

speech recognitioncomparison of strings of symbolspattern matching problem in a probabilistic frameworkprobability of a match

Mathematics Subject Classification ID

Combinatorial probability (60C05) Data structures (68P05) Limit theorems in probability theory (60F99)

Related Items (2)

Combinational optimization problems for which almost every algorithm is asymptotically optimal ⋮ A Probabilistic Analysis of a String Editing Problem and its Variations

Cites Work

• Probability approximations via the Poisson clumping heuristic
• Non-negative matrices and Markov chains.
• Unnamed Item
• Unnamed Item

This page was built for publication: A probabilistic analysis of a pattern matching problem