Algorithms for variable length Markov chain modeling

19
Algorithms for variable length Markov chain modeling Author: Gill Bejerano Presented by Xiangbin Qiu

description

Algorithms for variable length Markov chain modeling. Author: Gill Bejerano Presented by Xiangbin Qiu. Review of Markov Chain Model. Often used in bioinformatics to capture relatively simple sequence patterns, such as genomic CpG islands. Problem. - PowerPoint PPT Presentation

Transcript of Algorithms for variable length Markov chain modeling

Page 1: Algorithms for variable length Markov chain modeling

Algorithms for variable length Markov chain modeling

Author: Gill Bejerano

Presented by Xiangbin Qiu

Page 2: Algorithms for variable length Markov chain modeling

Review of Markov Chain Model• Often used in bioinformatics to capture relatively simple sequence patterns, such as genomic CpG islands.

Page 3: Algorithms for variable length Markov chain modeling

Problem

The low order Markov chains are poor classifiers

Higher order chains are often impractical to implement or train.The memory and training set size requirement

s of an order-k Markov chain grow exponentially with k!

Page 4: Algorithms for variable length Markov chain modeling

Variable length Markov Model (VMM) The models are not restricted to a

predefined uniform depth (e.g. order-k). The model is constructed that fits higher

order Markov dependencies where such contexts exist, while using lower order Markov dependencies elsewhere.

The order is determined by examining the training data.

Page 5: Algorithms for variable length Markov chain modeling

Description of Author’s Work

Four main modules are implemented:TrainPredictEmit2pfa

Page 6: Algorithms for variable length Markov chain modeling

Probabilistic Suffix Tree (PST)

A special tree data structure

Page 7: Algorithms for variable length Markov chain modeling

PST-Definitions

Σ the alphabet, string set: i= 1, 2 ..m

Empirical probability:

Conditional empirical probability:

Page 8: Algorithms for variable length Markov chain modeling

Parameters

Minimum probability:

Smoothing factors:

Memory length: L

Difference measure parameter: r

Page 9: Algorithms for variable length Markov chain modeling

Building the PST

Page 10: Algorithms for variable length Markov chain modeling

Biologically Extended PST- a Variant of PST Model

Page 11: Algorithms for variable length Markov chain modeling

Incremental Model Refinement

↑ L ↑ r → 1

Page 12: Algorithms for variable length Markov chain modeling

Prediction using a PST

Page 13: Algorithms for variable length Markov chain modeling

Results and Discussion

When averaged over all 170 families, the PST detected 90.7% of the true positives.

Much better than a typical BLAST search, and comparable to an HMM trained from a multiple alignment of the input sequences in a global search mode.

Page 14: Algorithms for variable length Markov chain modeling

Results and Discussion (Cont.)

Page 15: Algorithms for variable length Markov chain modeling

Results and Discussion (Cont.)

Page 16: Algorithms for variable length Markov chain modeling

Limitations

Page 17: Algorithms for variable length Markov chain modeling

Why Significant?

While performance comparable to HMM models

Built in a fully automated mannerWithout multiple alignmentWithout scoring matrices

Less demanding than HMMs in terms of data abundance and quality

Page 18: Algorithms for variable length Markov chain modeling

Future Work

An additional improvement is expected if a larger sample set is used to train the PST. Currently the PST is built from the training set alone.

Obviously, training the PST on all strings of a family should improve its prediction as well.

Page 19: Algorithms for variable length Markov chain modeling

Confused?