2 Simple Markov Models as compression models of interesting sequences ... One other useful property of simple Markov models is that they can be used to do adaptive compression--that is, the model can be trained on the database up to, but not including, the base being scored. Initially, the model predicts uniform...
www.cse.ucsc.edu/~karplus/ismb95-submit/ismb95-submit.h... www.cse.ucsc.edu/~karplus/ismb95-submit/ismb95-submit.html
This paper presents a technique for using simple Markov models and hidden Markov models (HMMs) to search for interesting sequences in a database of DNA sequences. The models are used to create a cost map for each sequence in the database.
www.cse.ucsc.edu/research/compbio/html_format_papers/tr... www.cse.ucsc.edu/research/compbio/html_format_papers/tr-94-24/tr-94-24.html
Markov chain - Wikipedia, the free encyclopedia
In mathematics, a Markov chain , named after Andrey Markov, is a random process where all information about the future is contained in the present state (i.e. one does not need to examine the past t...
en.wikipedia.org/wiki/Markov_chain
A simple Markov model of order k estimates the probabilities for letters in a given position based only on the characters in the preceding k positions. The model is trained by giving it a seed (a set ... Some previous work with using Markov models has concentrated on using them to predict the frequencies of short words [10,
www.soe.ucsc.edu/research/compbio/html_format_papers/is... www.soe.ucsc.edu/research/compbio/html_format_papers/ismb94/node6.html
; Next: Using hidden Markov models Up: ... One of the two largest REP clusters (REP99 or REP106) was chosen as a seed sequence and an order-8 simple Markov model was constructed from it. Since we are looking for the sequences on either strand of the DNA and a large part of what we are looking for is palindromic,
www.soe.ucsc.edu/research/compbio/html_format_papers/is... www.soe.ucsc.edu/research/compbio/html_format_papers/ismb94/node19.html
Hidden Markov models (HMMs) are widely used in bioinformatics, speech recognition and many other areas. This note presents HMMs via the framework of classical Markov chain models. A simple example is given to illustrate the model.
www.ingentaconnect.com/content/tandf/tmes/2004/00000035... www.ingentaconnect.com/content/tandf/tmes/2004/00000035/00000002/art00017
rdfs:label Simple Markov Models of the Genetic Algorithm in Classifier Systems: Accuracy-Based Fitness. (xsd:string)
dblp.l3s.de/d2r/resource/publications/conf/iwlcs/Bull00
This paper describes a simple method for extracting metadata fields from citations using hidden Markov models. The method is easy to implement and can achieve levels of precision and recall for heterogeneous citations comparable to or greater than other HMM-based methods.
portal.acm.org/ft_gateway.cfm?id=1378937&type=pdf
Simple Markov Models of the Genetic Algorithm in Classifier Systems: Accuracy-Based Fitness. Source, Lecture Notes In Computer Science; Vol. 1996 archive ...
portal.acm.org/citation.cfm?id=689044
2 Markov Chains. We will start by discussing the most simple Markov model, a Markov chain. We have already talked about these a little, since diffusion of a ...
www.cs.umd.edu/~djacobs/CMSC828seg/MarkovModels.pdf www.cs.umd.edu/~djacobs/CMSC828seg/MarkovModels.pdf