PMMdeNovo
by Ralf Eggeling, Teemu Roos, Petri Myllymäki, and Ivo Grosse
Runnable JARs
The application consists of three independent tools.
ModelTrainer
The tool ModelTrainer performs a de novo motif discovery on a set of putative non aligned sequences. It infers an inhomogenous PMM of arbitrary order, where order 0 corresponds to a PWM model. Run by calling
java -jar InhPMM.jar inputFile motifWidth motifOrder flankingOrder initSteps addSteps restarts output
where the arguments have the following semantics:
name | type | default | comment |
inputFile | String | -- | The location of a text file containing the input sequences. If the first character in the file is '>' the content is interpreted interpreted as fasta file. Otherwise it is interpreted as plain text, i.e., each line corresponding to one sequence. |
motifWidth | Integer | 20 | The width of the motif to be inferred. |
motifOrder | Integer | 2 | The initial order of the inhomogeneous PMM, i.e., the number of context positions that can be taken into account for modeling intra-motif dependencies. |
flankingOrder | Integer | 2 | The order of the homogenous Markov model, which is used for modeling the flanking sequences that do not belong to the motif. |
initSteps | Integer | 50 | The number of initial iterations steps that the algorithm is always run for each restart. |
addSteps | Integer | 10 | The number of additional iterations steps, i.e., the number of iterations that have to be performed after having obtained the last optimal model structure before termination is allowed. |
restarts | Integer | 10 | The number of restarts of the algorithm. |
output | String | model | The path and file prefix for the output files. The tool produces two files, namely (i) output.xml containing the learned model and (ii) output.dot containing the graphViz representation of the learned PCT structures. |
BindingSitePrediction
The tool BindingSitePrediction predicts instances of binding sites in a positive data set based on a previously learned model.
Classification
The tool Classification performs first a motif discovery with subsequent fragment-based classification using positive data that is assumed to contain an instance of the motif, and negative data that is assumed not to contain the motif. The tool returns the classification results to the standard output.
Data
The exemplary data sets contain extracted ChIP seq sequences of 50 different human transcription factors from the ENCODE project, as well as corresponding negative data. All data sets are split into 10 different subsets for enabling a reproducible 10-fold cross validation.
Source code
Building the source code requires Jstacs 2.1.