On the length of the longest subsequence avoiding an arbitrary pattern in a random permutation.

Michael H. Albert

Published in: Random Struct. Algorithms (2007)

Keyphrases

pattern matching
maximum number
upper bound
longest common subsequence
arbitrary length
pattern detection
real time
case study
user defined
fixed length
uniformly distributed
probabilistic model
associative memory