Skip to Main Content
Inference of Markov networks from finite sets of sample strings is formulated using dynamic programming. Strings are installed in a network sequentially via optimal string-to-network alignments computed with a dynamic programming matrix, the cost function of which uses relative frequency estimates of transition probabilities to emphasize landmark substrings common to the sample set. Properties of an inferred network are described and the method is illustrated with artificial data and with data representing banded human chromosomes.
Pattern Analysis and Machine Intelligence, IEEE Transactions on (Volume:PAMI-8 , Issue: 4 )
Date of Publication: July 1986