Abstract
Let and be two random sequences so that every random variable takes values in a finite set . We consider a global similarity score that measures the homology (relatedness) of words and . A typical example of such score is the length of the longest common subsequence. We study the order of central absolute moment in the case where two-dimensional process is a Markov chain on . This is a very general model involving independent Markov chains, hidden Markov models, Markov switching models and many more. Our main result establishes a general condition that guarantees that . We also perform simulations indicating the validity of the condition.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.