Abstract
In this note, some probabilistic models for replication of character strings are considered. These replication processes involve random mutations, deletions and insertions of characters. We investigate invariance of certain probabilistic properties of replicating character strings under the proposed stochastic models for the replication process. It is shown that some well-known types of hidden Markov models with finite state spaces arise as special cases of our stochastic replication models. We also introduce the notion of a hidden mixed Markov model for a character string that arises in a situation where the replication process satisfies exchangeability conditions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
