Metamotifs  a generative model for building families of nucleotide position weight matrices
 Matias Piipari^{1}Email author,
 Thomas A Down^{2} and
 Tim JP Hubbard^{1}
DOI: 10.1186/1471210511348
© Piipari et al; licensee BioMed Central Ltd. 2010
Received: 4 March 2010
Accepted: 25 June 2010
Published: 25 June 2010
Abstract
Background
Development of highthroughput methods for measuring DNA interactions of transcription factors together with computational advances in short motif inference algorithms is expanding our understanding of transcription factor binding site motifs. The consequential growth of sequence motif data sets makes it important to systematically group and categorise regulatory motifs. It has been shown that there are familial tendencies in DNA sequence motifs that are predictive of the family of factors that binds them. Further development of methods that detect and describe familial motif trends has the potential to help in measuring the similarity of novel computational motif predictions to previously known data and sensitively detecting regulatory motifs similar to previously known ones from novel sequence.
Results
We propose a probabilistic model for position weight matrix (PWM) sequence motif families. The model, which we call the 'metamotif' describes recurring familial patterns in a set of motifs. The metamotif framework models variation within a family of sequence motifs. It allows for simultaneous estimation of a series of independent metamotifs from input position weight matrix (PWM) motif data and does not assume that all input motif columns contribute to a familial pattern. We describe an algorithm for inferring metamotifs from weight matrix data. We then demonstrate the use of the model in two practical tasks: in the Bayesian NestedMICA model inference algorithm as a PWM prior to enhance motif inference sensitivity, and in a motif classification task where motifs are labelled according to their interacting DNA binding domain.
Conclusions
We show that metamotifs can be used as PWM priors in the NestedMICA motif inference algorithm to dramatically increase the sensitivity to infer motifs. Metamotifs were also successfully applied to a motif classification problem where sequence motif features were used to predict the family of protein DNA binding domains that would interact with it. The metamotif based classifier is shown to compare favourably to previous related methods. The metamotif has great potential for further use in machine learning tasks related to especially de novo computational sequence motif inference. The metamotif methods presented have been incorporated into the NestedMICA suite.
Background
A central goal in modelling genome regulation is the identification of transcription factors (TFs) and their target DNA binding sites, expressed as short nucleotide sequence motif models. This goal is becoming tractable even for higher eukaryotic genomes due to the availability of annotated reference genomes for numerous organisms, large scale proteinDNA interaction and gene expression studies, and advances in regulatory binding site motif inference algorithms.
Computational work to infer short DNA motifs has resulted in publication of literally hundreds of algorithms for approaching the problem (reviewed in [1, 2]). Perhaps most important computational advances in the field of DNAmotif inference are the introduction of scalable motif inference methods that can be used for de novo regulatory motif inference on a genome scale, with annotated reference genome sequences as input [3–5], and the effective use of supporting evidence such as gene expression microarrays [6, 7] or chromatin immunoprecipitation microarray (ChIPchip) [8, 9] or ChIPseq data [10, 11]. Several high throughput DNAprotein interaction assays have also been introduced during recent years. These include bacterial onehybrid assays [12] and protein binding microarrays [13].
The most widely applicable model for short regulatory motifs is the position weight matrix (PWM), originally introduced by Stormo et al [14]. The PWM is a model for gapless positionspecific probability distributions of nucleotides which assumes independence of nucleotide positions [15]. Departures of the position independence assumption have been reported in the form of variable length linkers, interdependencies between nucleotides at different binding site positions [16–18], and compensatory mutations that maintain the binding energy and function of binding sites [19]. More complex probabilistic motif models based on for instance Bayesian [20, 21] and Markov networks [22] have been developed to fit these observations. With the exception of the newest DNAprotein interaction assays which provide deep coverage of DNA interactions of proteins [23], parameter estimation of motif models more complex than the PWMis however hard with often scarce biological data. The PWM therefore remains the model of choice for most large scale motif inference tools: it is intuitive to interpret as a sequence logo [24] and retains more of the information contained in binding site patterns than sequence word based models [25].
Methods have also been developed for comparing and clustering motifs. One application of clustering is to infer information about possible function, such as likely binding partners. This is especially valuable for motifs from de novo inference methods which generally do not offer a predicted function for the signals they report. One specific application of clustering methods is the labelling of motifs with the protein DNA binding domain most likely to bind them. This is based on the observation that the sequence specificity of structurally related binding proteins is similar. Familial binding profiles (FBP) offer one early solution [26]. FBPs are essentially average motifs derived from multiple alignments of motifs optimised to minimise the sum of squared deviations (SSD) between aligned motif columns amongst a familial multiple alignment of PWMs. FBPs for common transcription factor families are available through the JASPAR motif database [27].
Motif clustering methods however suffer from the absence of a natural distance metric between motifs; different metrics are thought to provide complementary information of motif relatedness. A χ^{2} based distance metric was found an effective measure by [28]. A metric based on Pearson correlations of motif columns was also described in the same publication. Clustering based on various other distance metrics was suggested and systematically evaluated by [29]. A sum of squared deviations based metric was found to be the best single metric in this systematic comparison of a number of distance methods. The asymptotic covariance between hits of two motifs in a sequence has also been applied as a distance measure [30]. The most recent motif distance metric and clustering methods are probabilistic and draw special attention to the uncertainty in motif comparison and the importance of highinformation columns in measuring distances of sequence motifs: a Bayesian probability distance metric between motif columns [31] and a fuzzy integral based metric [32]. In this work we also explore a probabilistic solution for the problem of comparing motifs.
Supervised learning strategies have also been applied to classify motifs and infer motifs similar to previously known motifs from novel sequences. Neural networks have been applied for classification of binding sites for the purposes of motif inference by [33]. Other notable methods include a Sparse Multinomial Regression (SMLR) based binding site sequence classification described in [34], and an application of this method for motif inference; The motif inference program PRIORITY assigns an SMLR derived prior probability for each sequence position for its potential to fit a motif of a given transcription factor family [35].
We present here a probabilistic model for describing motif families and measuring relatedness of sequence motifs. We show sequence motif related machine learning uses for the model. At its simplest, a metamotif can be used to summarise gapless alignments of motifs of a given length, similarly as the FBP described above. As opposed to the FBP, we however do not model the recurring patterns found amongst a related set of motifs as a single motif alignment model but allow multiple components to describe a motif family.
We model a motif family as a series of motif components ("metamotifs") where different positions of a PWM motif can potentially map to different metamotifs. Not all positions are generated from a metamotif but some are treated as noise emitted by a background model. The metamotif includes a vector of column wise mean nucleotide weights, as well as variance for each column which is not modelled for example by the FBP. In this respect a metamotif is similar to the model used by MotifPrototyper [36]: both describe familiar prototypes of PWMs that are estimated probabilistically with a sequence of position specific probability distributions and can yield a Bayesian prior on the weight matrix columns (a 'structural prior' for the weight matrices in the terminology used by Xing et al.). In contrast to MotifPrototyper, the metamotif inference algorithm we developed can account for intramotif structure such as repeating or palindromic segments by treating motifs as a series of several metamotifs and background positions.
Results and Discussion
Below we first describe the metamotif in detail. We then expand the use of the model beyond simply constructing metamotifs as global gapless alignment models of motif sets. This expansion is made possible by a Markov Chain Monte Carlo (MCMC) metamotif inference algorithm that simultaneously estimates multiple weakly represented metamotifs from a potentially large set of motifs. Illustrative examples of metamotifs are shown in Figure 1 alongside the input motifs for which the metamotifs were estimated.
The metamotif
We have developed a visualization for the metamotif akin to the sequence logo. Our visualization presents both the mean weights [Xα] and precision α_{0} aspects of the metamotif. A sequence logo is drawn for PWM with nucleotide weights [Xα]. Error bars are shown to highlight 95% confidence intervals of nucleotide weights of the Dirichlet density at α_{ i }for each symbol i, j (Figure 1).
Metamotif inference by nested sampling
The metamotif can be seen as a way to summarise a gapless alignment of motifs of a certain length, to yield a probability distribution of motifs. However, our goal in designing the metamotif framework was to describe recurring patterns seen in sequence motif data deposited in public motif databases such as TRANSFAC [37], JASPAR [38] or UniPROBE [39]. Many sequence motif families cannot be described accurately by global gapless multiple alignments of motifs at a fixed length. Motifs can for example consist of shorter repetitive signals, such as in the case of the heatshock factor (HSF) motifs (Figure 1D), or the basic HelixLoopHelix (bHLH) motif family that are completely or partially palindromic due to their dimeric binding mode [40]. Inspection of the HSF motif set shows that a global alignment of its columns does not describe the regularly spaced fivebase repeat that is observed as part of the motifs in opposing orientations (aGAAn/nTTCt) [41]. Furthermore, even nonrepetitive and nonpalindromic motifs present challenges for gapless multiple alignments: the span of informative columns contributing to familial patterns in publicly available PWM data is often unclear because of different signaltonoise ratios and varying information content criteria used for calling motif ends.
We wanted to develop an inference algorithm that allows simultaneous detection of n short metamotif signals from a set of motif data, allowing for varying length for different metamotifs, and optionally free orientation (signal present on either strand). The metamotif count n is a fixed, user settable parameter to the algorithm. For metamotif inference problems where n is expected to be large, the choice for the parameter should be informed by prior information of the motif set under study, for example clustering of the motifs to estimate a rough number of recurring motif segments. Each metamotif has a priori an unknown length between l_{ min }and l_{ max }columns, and is expected to contain one or more matches in a fraction f of motifs. Motifs in the framework are thought to be generated by recurring metamotif patterns, each of which is potentially shorter than any of the motifs, and background positions that model "uninteresting" sections of the motifs (positions not emitted by any of the metamotifs). The background model in the framework is the maximum likelihood (MLE) Dirichlet distribution estimated from all the motif columns in the input data. It is computed with the optimisation procedure described in [42].
Our metamotif inference algorithm is a variant of the NestedMICA nested sampling algorithm described in detail in [43]. Nested sampling, originally introduced by [44], is a generic Bayesian MCMC sampling strategy that allows drawing samples from a posterior distribution and directly estimating the evidence (marginal likelihood) of the model. In brief, nested sampling operates on an ensemble of states ranked by their likelihood. The initial state of the algorithm is drawn by sampling uniformly from the prior distribution. At each iteration, the state with the lowest likelihood is removed from the ensemble and replaced with a new state whose likelihood is bounded to be higher than that of the removed state. New states are created either by drawing samples from the prior distribution of states, or by decorrelating other randomly chosen states in the ensemble.
The metamotif inference algorithm allows estimating n metamotifs for a set of p motifs, with a variable metamotif length between l_{ min }and l_{ max }columns, and an expected fraction f of motifs containing any one of the n metamotifs. This is analogous to the NestedMICA motif inference algorithm that estimates multiple motifs with varying length from an expected fraction of nucleotide or protein sequence data. The posterior distribution being sampled is over the sets of m metamotifs and socalled mixture matrices, given the motif data and a background model for the motifs. The mixture (or occupancy) matrix describes the pairing between metamotifs and motifs. The term mixing matrix is a reference to the algorithm treating pattern recognition as an independent component analysis problem: a likelihood function is written for the observations (the motif set) and the motif set is assumed to be generated as a mixture of independent metamotif contributions and noise represented by the background model. Each element Q_{i, j}in the n × p mixing matrix Q is a binary indicator of the metamotif j being present one or more times in the motif i. If the metamotif is present, Q_{i, j}= 1, otherwise Q_{i, j}= 0. The likelihood of the motif set given the metamotif set is simply the product of likelihoods of each individual motif given the metamotif set and the mixture matrix.
L_{ c }represents the likelihood of all metamotif and background column arrangements (paths) in the input motif up to the column c. M is the set of metamotifs that have a mixing coefficient of 1 for the motif under consideration (i.e. metamotifs marked to be present in the motif in the mixing matrix Q), and M is the number of metamotifs that have a mixing coefficient 1. The length of the metamotif α is represented by l_{ α }. B_{ c }is the probability that the motif column at position c was emitted by the background. For the motif X of length l_{ X }the transition probability t to a metamotif is defined as t = 1/l_{ X }, i.e. one metamotif is expected per motif, and any motif position is equally likely to contain a transition. is the probability that the motif segment from i to j was emitted by a metamotif m, and it is given by the metamotif density function (Equation 4). A metamotif can optionally be allowed to be present on either strand to improve our ability to detect repeating (e.g. palindromic) features. Alternating orientation of metamotifs are achieved simply by summing the probability contributions of the metamotif α and its reverse complement at all possible offsets.
Accounting for incomplete metamotif matches in a motif is an important consideration. This is because we wish to analyse data from different experimental and computational sources where motif start or end positions have not been chosen consistently, for instance with an information content criterion. Incomplete hits are accounted for by adding l_{ max }additional "uninformative" columns in the input motifs in both the 5' and the 3' motif ends. The uninformative columns are multinomial distributions that match the mean nucleotide weights of the background model Dirichlet distribution. This effectively allows all possible offsets of the metamotif that overlap the motif with at least one column, whilst associating more uncertainty to those columns supported by only a subset of the motif data.
Performance of the metamotif inference algorithm was tested using synthetic motif sets where samples from known metamotifs were inserted, or "spiked". The aim was to measure the relative frequency of metamotifs at which the expected metamotifs could be recovered by the algorithm from synthetic motif data containing metamotif instances. The evaluations were done in two stages. The ability of the algorithm to infer a single metamotif presented to it was tested first. After that, several metamotifs were presented to the algorithm to assess the ability of the algorithm to infer multiple metamotifs simultaneously.
To prepare the synthetic motif sets, metamotifs were first generated of examples of three structurally diverse TRANSFAC 12.2 PWM families: six forkhead motifs (class 3.3 in TRANSFAC classification), six GATAlike Cys_{4} zinc finger motifs (class 2.1) and five MADS box motifs (class 4.4) were used (source motifs shown in Additional file 1 Figure S3). This was done by aligning the input each of the three motif sets with a greedy gapless sequence motif multiple alignment method similar to the one utilised in STAMP motif toolkit [45]. A metamotif was then estimated from the motif multiple alignments with the MLE method from [42]: MLE Dirichlet distribution was computed for motif alignment columns (example seen in Figure 1A), with each motif column in the alignment mapping to a MLE Dirichlet distribution in the resulting metamotif.
Motifs (PWMs) from each of the three familial metamotifs were sampled in relative frequencies of 0%, 10%, 20%,...,100%, into synthetic input motif sets (separate input motif set per motif family). Each synthetic motif set contained 60 motifs, each 20 nucleotide columns long, with a maximum of one metamotif instance allowed per input motif. The synthetic motif columns in the input motif sets are samples from a Dirichlet distribution with parameters α = {0.5, 0.5, 0.5, 0.5}. The metamotif sample PWMs were inserted at random positions within the 20 nucleotide long synthetic motifs (example GATA motif set given in Additional file 1 Figure S4A,B,C). The metamotif inference algorithm was then run on the motif set to infer a single metamotif between length ranges 4 and 14, allowing for the signal to be present in either orientation (numMetamotifs 1 revComp minLength 4 maxLength 14).
The ability to predict multiple metamotifs was demonstrated in a second evaluation experiment where instances of all the three motif families were inserted into synthetic motif sets and the algorithm was required to infer three metamotifs. It was shown that the algorithm was able to infer multiple metamotif models concurrently at a relative frequency as low as 20% (Additional file 1 Figure S5).
Our results show that the metamotif nested sampler algorithm, the first metamotif inference algorithm to be described, can discover detailed structure from motif sets. We show the algorithm is capable of correctly inferring multiple familial metamotif patterns. This makes the algorithm applicable for example for finding redundant motif patterns from large scale de novo inferred motif predictions from different algorithms, or for inferring a complete set of familial metamotifs from a set of motifs.
Metamotifs as a position weight matrix prior
De novo gene regulatory motif inference algorithms commonly suffer from lack of sensitivity when applied to large collections of long eukaryotic promoter sequences, rendering it impossible to describe complete sets of regulatory motifs with sequence alone. We therefore wanted to see if prior biological knowledge in the form of familial metamotifs could be used to improve the sensitivity of a motif inference algorithm. This was motivated by the work by [35] which showed familial tendencies in the motifs of sequence specific transcription factors can improve motif inference sensitivity. We therefore wanted to test if a probabilistic model of the observed spectrum of DNA specificity of known transcription factor motif families expressed as a metamotif could be used to improve the sensitivity of motif inference from novel sequence.
We extended the NestedMICA motif inference algorithm to accept a series of metamotifs as a position specific prior probability function for motifs. The NestedMICA algorithm was chosen for the purpose as it is known to perform well in large scale motif inference tasks [3, 46], and because the previously published version of the algorithm applies an uninformative Dirichlet prior probability function to motif columns (all allowed nucleotide weight combinations equally probable a priori), which made it straightforward to change the algorithm to take use of columnspecific informative Dirichlet distributions.
The prior probability of motif X given a metamotif α is taken as the sum of metamotif densities of α with all continuous motif segments contained in X that have the same length l as the metamotif (log of the density is given by Equation 4). A segment of motif X refers to a motif formed from columns of the motif starting from column i and ending at position i + l  1. The prior probability of a motif given series of metamotifs is simply the sum of prior density contributions of each of the metamotifs.
To test the performance of the metamotif prior, we conducted simulation experiments following the same principle as described for the NestedMICA [46] and the BayesMD [47] algorithms. Human intronic nucleotide sequence fragments randomly chosen from the Homo sapiens Ensembl database release 50 [48]) were 'spiked' with five different types of motifs. The motifs used were those of ZAP1, HIF1, TBX5, TAL1 and NFκ B transcription factors. These motifs were selected because they showed little similarity with each other when aligned, and because this set contains examples of differing motif length and information content. All sequence sets used contained 200 sequences, and the total length of the sequence was varied between 100, 200,...,2000 nucleotides. The nucleotide kmers sampled from each of the five PWMs in the evaluation were inserted at a constant relative frequency of 20% of the sequences, with a maximum of one motif present per sequence. In other words, motif density was varied by inserting the motif instances to sequences of different lengths. Motifs of only one kind were present in each synthetic sequence set.
Motif inference with three types of prior functions were tested with the sequences: firstly a single familial metamotif contributing to the prior function was used. Secondly we tested a prior function with all of the five unrelated metamotifs contributing to the prior, with instances of only one motif family being actually present represented in the sequences. Thirdly, we used an uninformative PWM prior similar to the previously published NestedMICA version 0.8. In each of the motif inference runs, the longest sequence length at which the algorithm infers the correct motif of interest is reported as a measure of sensitivity (p < 0.05), with motif comparison p values computed as described in [3]. In all cases, five motifs were inferred from the sequences (as recurring sequence motifs tend to be found from intronic sequences, we cannot assume that the spiked motif would be the only signal present). The sequence background model used in all evaluations of the algorithm was a 4class 1^{ st }order trained from the 2000 nt long intronic sequences with nmmakebg.
The informative motif prior function was shown to dramatically improve the capacity of the NestedMICA algorithm to resolve weakly represented sequence motifs presented to it in longer nucleotide sequences, especially those with larger number of columns and higher information content (Figure 4B). Both the baseline motif inference sensitivity and the effect of the informative weight matrix prior was seen to vary based on the length (likely due to the information content) of the motifs, ranging from as high as fourfold difference in the motif recovery length for TAL1 and NFKappaβ, to only a 1/3 improvement from 400 bp to 600 bp sequence between the uninformative and the 'single' informative metamotif prior for the TBX5 motif. Sensitivity to infer all but the TBX5 motif showed improvement with the combinatorial metamotif prior over the uninformative prior, with the effect less pronounced than when the prior function only contained a contribution from the correct metamotif. These results suggest that the metamotif prior is performing as hoped, and multiple metamotifs can be combined to a 'combination metamotif prior function' to detect motifs where information is available of candidate motifs.
We wanted to ensure that the metamotif prior did not have the propensity to bias motif inference to an incorrect solution, i.e. that it does not encourage the inference of a motif not supported by the sequence data. We tested this by spiking intronic sequence with the NFκ B motif, and using the ZAP1like metamotif in the prior function. No motifs similar to ZAP1 (whose instances were not present in the sequences) were recovered from the spiked intronic sequence between lengths 100 and 2000 (comparison with distances and pvalues shown in Additional file 1 Figure S6), indicating that the metamotif prior function does not have an adverse effect on inference specificity. A number of other combinations of spiked motifs and inaccurate informative metamotif prior functions were also tested, with no observed tendency for the algorithm to infer a motif that not supported by the sequence data (data not shown).
The metamotif prior extension to the NestedMICA algorithm is designed to function with any number of metamotif models, input PWMs or IUPAC consensus sequences. PWMs are treated as metamotif priors by interpreting its columns i as the [Xα] of a metamotif and applying a constant precision α_{0} to all columns of the metamotif. IUPAC consensus sequences are first transformed to PWMs by applying pseudocounts and then transformed similarly as PWMs. Metamotifs inferred with our framework could also be applied to other Bayesian motif inference algorithms which model a prior distribution over motif columns. Metamotifs could therefore be useful in building large or even complete regulatory binding site motif libraries for novel genomes.
Predicting regulatory motif type with metamotifs
The metamotif is shown above to improve motif inference sensitivity dramatically when used as a Bayesian PWM prior. We however also wanted to test if metamotifs could be used to form functional predictions for novel motifs based on a database of previously known motifs. We developed a motif classification tool for the purpose, termed metamatti, for metam otif based a utomated t ranscription factor t ype i nference.
Features calculated for motifs in the metamatti classifier
Feature  Description 

Maximum metamotif hit scores with all of the familial metamotifs  Motifs were scanned with all input metamotifs and the optimal score was chosen. Both familially discovered and models discovered. 
Percolumn average entropy  Average Shannon entropy of columns. 
MLE Dirichlet parameters  A maximum likelihood Dirichlet distribution is estimated as described in [42] and the parameters of this distribution are used as features (α_{ A },α_{ G },α_{ C },α_{ T }). 
Symmetric Dirichlet background parameters  A symmetric Dirichlet distribution is estimated as described above. 
All motif families with at least 10 representatives were retrieved from the TRANSFAC 12.2 database [37], totalling 623 motifs of 13 domain families. For the motif domain superfamily classifier comparison made with MotifPrototyper [36] (Figure 5A), the set of motifs was reduced further to include only motifs annotated in TRANSFAC with the four superfamilies classified in [36]. Similarly, for the motif family classification comparison with SMLR [34] (Figure 5B), only motifs of the same six major classes classified in [34] were included in our training set.
Most features in the classifier are metamotif probability density scores of the training set motifs with metamotifs trained from motifs of each of the motif families. To compute the density features, we chose to first divide the motifs of each family into smaller clusters by complete linkage hierarchical clustering them with the SSD metric described in [3] and cutting the clusters at a lenient clustering cutoff of 6.0, resulting in 65 motif clusters. Three metamotifs were trained from each motif cluster with nmmetainfer, resulting in 195 metamotifs to be used in the motif classifier (examples seen in Figure 3). Metamotif length was constrained between 6 and 15 columns, and the expected usage fraction was set at 0.5.
Motif classification performance of metamatti was compared to two methods with a related goal: MotifPrototyper [36] which classifies motifs into four TRANSFAC superfamilies (zinc coordinated, helixturnhelix, βscaffold,basic), and SMLR which classifies motifs into six major classes of TF domains (Cys_{2}His_{2} and Cys4 zinc fingers, homeodomains, forkhead domains, basic helixloophelices and basic zipper domains) [34].
Classification accuracy comparison shows that metamatti outperforms MotifPrototyper [36] (Figure 5A) across all motif superfamilies. There are several possible reasons for the difference in performance. Firstly, the metamotif inference algorithm is not constrained to a fixed motif family model column count, unlike the algorithm utilised in MotifPrototyper. Secondly, training several metamotifs per motif family, metamatti also accounts for the fact that not all columns in motif families can be accurately expressed as a single column wise probability distribution. Instead, recurring patterns in a motif set can be generated by multiple potentially shorter familial metamotif components in our model. Thirdly, the metamotif estimation algorithm treats some motif columns as noise with a column background model, improving our capacity to find the recurring patterns from sequence motif sets and reducing overfitting of familial models due to reporting weak or nonexistent recurring trends.
Confusion matrix of the 6way TRANSFAC motif classification
Cys4  C2H2  bHLH  bZIP  Forkhead  Homeodomain  Class error  

Cys4  39  0  0  0  0  1  0.025 
C2H2  0  38  3  0  1  3  0.156 
bHLH  0  2  22  5  0  0  0.24 
bZIP  0  3  0  78  0  4  0.08 
Forkhead  0  0  0  0  31  2  0.09 
Homeodomain  2  1  1  3  0  37  0.16 
Totals  41  43  26  86  32  47 
Clustering of the motifs and training metamotifs from motif clusters was motivated by the requirement to choose a value for the metamotif count parameter of the metamotif inference algorithm, and to limit the metamotif search space. Inspection of clusters at cut off 6.0 showed no clusters with more than three strongly distinct recurring patterns. Although for many motif clusters there were clearly less than three distinct recurring metamotif patterns present at the clustering cutoff of 6.0, the metamotif inference algorithm was found to treat these cases by either inferring closely similar duplicate metamotifs (such as metamotifs 1 and 2 in Figure 3A) or short metamotifs with mean nucleotide weights with low information content, or occasionally splitting the metamotif segments in several independent parts. This suggested to us that that together with a sparse machine learning strategy such as a random forests, it would be advantageous to choose a high metamotif count that described the input motif set in as much detail as possible, with the price of some potentially redundant features in the feature set (densities for duplicate or low information metamotifs). We validated this assumption by retraining the classifier with two metamotifs per cluster (a total of 130 metamotifs). The classifier trained with two metamotifs per family resulted in a mild decrease in the classification accuracy (88.4%, as opposed to 89.5% with three metamotifs per cluster), suggesting that the additional metamotifs were indeed informative.
We also wanted to assess the significance of the metamotif density score in the metamatti classifier by comparing it to a more naive classifier where we replace the metamotif average and maximum scores with average and maximum SSD distances computed between the training set motifs and 'average motifs' of each of the motif family, instead of scoring training set motifs with familial metamotif density average and maximum scores. The average motifs we used in the more naive classifier were the mean PWMs of the metamotifs trained with nmmetainfer were used for classification by scoring the training set motifs with an SSD distance metric with each of the metamotifs. We found that the classifier accuracy achieved with the SSD metric was lower to the metamotif density based classifier by 1.4% (accuracy of 88.1%), suggesting that both the metamotif mean and the column wise precision values which contribute to the metamotif density scores are partially responsible for metamatti's high performance. Furthermore, we tested training a classifier with cluster average motifs instead of the metamotif segments, resulting in an accuracy figure of 86.5%, suggesting that not only is the metamotif density a suitable score, but that the motif segments identified by the metamotif inference algorithm provide a classifier that generalises better than simply using average motifs inferred by clustering and collapsing clustered motifs to an average representation.
Independent validation of the TRANSFAC family prediction of motifs
Previous motif classification work has relied on separating training and testing data from a single public database using crossvalidation [26, 34, 36], where most motifs originate from individual studies and therefore different experimental sources. Recent advances in proteinDNA interaction assaying have however resulted in several large highthroughput regulatory motif data sets becoming publicly available. We therefore wanted to assess the performance of metamatti with two homeodomain motif sets recovered from different species and via different experimental methods: Mus musculus protein binding microarray motifs [51] and Drosophila melanogaster bacterial onehybrid motifs [52]. This evaluation also allowed us to compare the classification accuracy achieved with the two independent datasets to the accuracy expected based on the out of bag classification error estimate of the metamatti random forest classifier training for the homeodomain motif family.
We trained a metamatti classifier with all 13 motif families present in the TRANSFAC 12.2 with at least 10 examples per family (total of 663 motifs) for evaluating classification of the two homeodomain motif datasets. The accuracy reported for both Drosophila melanogaster and Mus musculus datasets was the fraction of motifs labelled as homeodomain instead of any of the 12 incorrect labels.
The classification accuracy rates for both homeodomain motif sets were shown to be high, and in good agreement with the outofbag accuracy estimate of 91.3% reported by the metamatti random classifier during classifier training: 92.1% and 91.7% of the homeodomain motifs in the Berger et al. (84 motifs) and Noyes et al. (177 motifs) sets were correctly classified, respectively. We studied the misclassified examples from the Drosophila melanogaster homeodomain datasets in more detail to see where the misclassified motifs lie in the homeodomain specificity group clustering presented in [52]. Interestingly, the misclassifications were shown to be atypical homeodomains which do not contain the canonical TAATTA core and fall amongst the smaller specificity groups described in [52]. The misclassified motifs included three TGIFExdlike motifs (Vis, Hth, Exd), two Iroquislike (Ara, Mirr), one Sixlike (Optix) and an outlier from the specificity group clustering (Additional file 1 Figure S7A). A similar trend of noncanonical homeodomains being primarily amongst the misclassified was also noted for the Mus musculus homeodomain motifs (Additional file 1 Figure S7B). This is most likely explained by atypical homeodomain motifs not being well covered well by the TRANSFAC 12.2 training set; No closely matching homeodomain motifs were observed in TRANSFAC 12.2 to many of the misclassified motifs.
Confusion matrix of the homeodomain motif specificity group classifier
AbdB  Antp  Bar  Bed  Engrailed  Iroquis  NK1  NK2  TGIFExd  Class error  

AbdB  5  0  0  0  0  0  0  0  0  0.00 
Antp  0  15  0  0  2  0  0  0  0  0.12 
Bar  0  0  5  0  1  0  0  0  0  0.17 
Bcd  0  0  0  4  0  0  0  0  0  0.00 
Engrailed  0  1  1  0  23  0  0  0  0  0.08 
Iroquis  0  0  0  0  0  3  0  0  0  0.00 
NK1  0  0  0  0  3  0  2  0  0  0.60 
NK2  0  0  0  1  0  0  2  0  0  0.33 
Six  0  0  0  1  0  0  2  1  1  0.67 
TGIFExd  0  0  0  0  0  0  0  1  3  0.25 
Totals  5  16  6  5  29  0  4  3 
Conclusions
We present a novel motif family model, the metamotif. We show its use as an informative prior in a motif discovery algorithm, and describe a motif classification method based on metamotif density features. We find that the method compares favourably to previously published related methods. Its performance with two novel experimental TFBS motif datasets is also found consistent with expected error estimates. The metamotif inference and visualisation tools are made openly available as part of the NestedMICA motif inference suite, and the interactive motif inference analysis environment iMotifs [53]. We also introduce a visual representation for the metamotif akin the sequence logo, which presents the metamotif as an average motif with confidence intervals for symbol weights.
We envisage that the metamotif will have further machine learning related uses in addition to the Bayesian prior and motif family classification method we present. Large scale computational motif inference frameworks especially could benefit from metamotif driven semisupervised methods to either effectively estimate complete motif sets from novel sequence sets, or on the contrary to discriminatively infer motifs that do not not closely match known sequence motifs. Further largescale profiling of eukaryotic transcription factor DNA specificity could also dramatically extend the data available for training metamattilike motif classifiers that infer motif type labels, to allow more fine grained classification than the binding domain family or superfamily classification described in this work.
Methods
Metamotif inference by nested sampling
The metamotif inference algorithm evolves metamotif parameters and the mixture matrix state with Monte Carlo sampling moves. Most of the proposal types alter the metamotif column α parameters. The metamotif proposals are selected randomly from amongst the following set of moves:

a small perturbation is made to a randomly selected metamotif column nucleotide mean weight: perturbation is made according to a randomly chosen nucleotide α weight α_{ i }, nucleotide mean weights adjusted so they again sum to 1, and α_{ i }of the column adjusted accordingly, maintaining precision unchanged.

a small perturbation is made to a randomly selected metamotif column precision α_{0}: α_{0} is perturbed, and α adjusted such as to maintain the mean nucleotide weights unchanged with a new precision.

a small perturbation is made to a randomly selected metamotif column nucleotide weight α_{ i }, thereby indirectly changing the precision.

replacing a metamotif column with a new one, sampled from an uninformative simplex prior (nucleotide weights on the range [0.1, 40.0] are allowed).

removing a column in one end of a metamotif while adding another one to the other end.

adjusting motif length, by adding or removing a column from either end.
The two update operations that use an alternative parametrisation of α with precision and the mean nucleotide weights, i.e. updating the precision whilst maintaining mean weights unchanged, and altering the mean weights whilst maintaining the precision unchanged, proved beneficial for achieving convergence of the algorithm. When these moves were included, the algorithm consistently converged with smaller number of iterations than when only the more naive method of updating α_{ i }with random perturbations was included (data not shown). The prior function over the Dirichlet distribution parameters was an uninformative 'clipped' simplex prior: all values for the nucleotide weight parameters α_{ i }of the distribution are allowed on the range [0.1, 40.0] and equally likely. Parameter values above or below this range are clipped such as to avoid numerical instability.
Sampling moves are also done in the the space of mixture matrices by flipping states of randomly selected elements in the mixture matrix similarly as is described in [43] for the NestedMICA algorithm.
The metamotif nested sampler algorithm was developed in Java and is made available in the Nested MICA suite as a command line tool nmmetainfer. Because the parameters of the metamotif inference algorithmare highly similar to the motif inference algorithm in NestedMICA, the command line interface of nmmetainfer was also designed to be analogous to the motif inference tool nminfer included in the suite.
Metamotif visualization
The metamotif visualization was implemented to the iMotifs sequence motif visualization environment [53] with the Mac OS X Cocoa drawing API (ObjectiveC programming language). Metamotif model visualization was also implemented in a Java based crossplatform motif visualization tool mXplor (see 'Availability and requirements' for more detail).
Metamotifs as a position weight matrix prior
Human intronic sequences used in the metamotif prior performance evaluation were retrieved from the Ensembl database using the Ensembl Ruby API (unpublished, available from http://github.com/jandot/rubyensemblapi). Regions overlapping with annotated repeats called with RepeatMasker [54] and dust [55] were rejected.
The PWM prior was implemented as part of the NestedMICA motif inference tool nminfer. A metamotif PWM prior can be supplied to nminfer either as an XMS formatted metamotif file with the argument priorMetamotifs or as a an IUPAC consensus string (consensus) with a set precision and pseudocount applied to the mean nucleotide weights (priorPrecision and priorPseudocount). NestedMICA motif inference was done in each case with the expected usage fraction parameter at 0.2, allowing for weight matrix occurences on either strand, and constraining the minimum motif length to 6 and maximum length to 14 (expectedUsage Fraction 0.2revComp minLength 6 maxLength 14).
The XMS file format that is used for exchanging motif data by NestedMICA and iMotifs is also used for representing metamotifs (see NestedMICA manual for more information). A crossplatform programming interface libxms is also available for reading and writing XMS formatted files for several common programming languages (Perl, Ruby, R, Java, ObjectiveC) [53] and the metamotifs can therefore be readily taken use of by other motif inference tools.
Predicting regulatory motif type with metamotifs
The metamatti motif type classifier training and crossvalidation were implemented in the Ruby and R [56] programming languages. Random forest classification was done using the package randomForest [57]. Pseudocounts of 0.01 were added to all training set metamotifs, and the mtry parameter of the random forest classifier training was optimised by testing 0.1 × , 0.2 × ..., 2.0 × with intervals of 0.1, where p is the number of features in the classifier (the default value for mtry is ). The ntree parameter that controls the number of trees to grow was set at 5000.
Availability and requirements
The metamotif inference and metamotif PWM prior enabled version of the crossplatform Java based NestedMICA suite is available on the Nested MICA project website at http://www.sanger.ac.uk/Software/analysis/nmica. The algorithms used in the metamotif inference validation experiment are also made available in the NestedMICA suite. These include the motif alignment tool nmalign (outputs the motif alignment as a FBP, set of aligned motifs, or MLE metamotifs), as well as the motif simulation tool nmmetasim.
Metamotif visualisation is made available as part of the Mac OS X based motif viewer iMotifs [53] http://www.github.com/mz2/imotifs, and the crossplatform Java based motif viewer MotifXplorer http://github.com/mz2/mxplor
All the above software is distributed under the Lesser General Public Licence (GPL) version 2.0 or later.
Declarations
Acknowledgements
We would like to thank Leopold Parts for assistance with formulating the metamotif model and critical reading of the manuscript, and Ville Mustonen, Marija Buljan and Steve Pettitt for critical reading and helpful feedback on the manuscript.
This work was supported by the Wellcome Trust grant number 077198/Z/05/Z.
Authors’ Affiliations
References
 Das MK, Dai HK: A survey of DNA motif finding algorithms. BMC Bioinformatics 2007, 8(Suppl 7):S21. 10.1186/147121058S7S21View ArticlePubMedPubMed CentralGoogle Scholar
 Tompa M, Li N, Bailey TL, Church GM, Moor BD, Eskin E, Favorov AV, Frith MC, Fu Y, Kent WJ, Makeev VJ, Mironov AA, Noble WS, Pavesi G, Pesole G, R'egnier M, Simonis N, Sinha S, Thijs G, van Helden J, Vandenbogaert M, Weng Z, Workman C, Ye C, Zhu Z: Assessing computational tools for the discovery of transcription factor binding sites. Nat Biotechnol 2005, 23: 137–144. 10.1038/nbt1053View ArticlePubMedGoogle Scholar
 Down TA, Bergman CM, Su J, Hubbard TJP: LargeScale Discovery of Promoter Motifs in Drosophila melanogaster. PLoS Comput Biol 2007, 3: e7. 10.1371/journal.pcbi.0030007View ArticlePubMedPubMed CentralGoogle Scholar
 Xie X, Lu J, Kulbokas EJ, Golub TR, Mootha V, LindbladToh K, Lander ES, Kellis M: Systematic discovery of regulatory motifs in human promoters and 3' UTRs by comparison of several mammals. Nature 2005, 434(7031):338–345. 10.1038/nature03441View ArticlePubMedPubMed CentralGoogle Scholar
 Xie X, Mikkelsen TS, Gnirke A, LindbladToh K, Kellis M, Lander ES: Systematic discovery of regulatory motifs in conserved regions of the human genome, including thousands of CTCF insulator sites. Proc Natl Acad Sci USA 2007, 104(17):7145–50. 10.1073/pnas.0701811104View ArticlePubMedPubMed CentralGoogle Scholar
 Chen X, Guo L, Fan Z, Jiang T: WAlignACE: an improved Gibbs sampling algorithm based on more accurate position weight matrices learned from sequence and gene expression/ChIPchip data. Bioinformatics 2008, 24(9):1121–8. 10.1093/bioinformatics/btn088View ArticlePubMedGoogle Scholar
 Bussemaker HJ, Li H, Siggia ED: Regulatory element detection using correlation with expression. Nat Genet 2001, 27(2):167–71. 10.1038/84792View ArticlePubMedGoogle Scholar
 Liu X, Brutlag D, Liu J: An algorithm for finding proteinDNA binding sites with applications to chromatinimmunoprecipitation microarray experiments. Nature biotechnology 2002, 20(8):835–839.View ArticlePubMedGoogle Scholar
 Conlon EM, Liu XS, Lieb JD, Liu JS: Integrating regulatory motif discovery and genomewide expression analysis. Proc Natl Acad Sci USA 2003, 100(6):3339–44. 10.1073/pnas.0630591100View ArticlePubMedPubMed CentralGoogle Scholar
 Hu M, Yu J, Taylor JMG, Chinnaiyan AM, Qin ZS: On the detection and refinement of transcription factor binding sites using ChIPSeq data. Nucleic Acids Research 2010, 38(7):2154–67. 10.1093/nar/gkp1180View ArticlePubMedPubMed CentralGoogle Scholar
 Won KJ, Ren B, Wang W: Genomewide prediction of transcription factor binding sites using an integrated model. Genome Biol 2010, 11: R7. 10.1186/gb2010111r7View ArticlePubMedPubMed CentralGoogle Scholar
 Meng X, Wolfe SA: Identifying DNA sequences recognized by a transcription factor using a bacterial onehybrid system. Nat Methods 2006, 1: 30–45. 10.1038/nprot.2006.6Google Scholar
 Berger MF, Philippakis AA, Qureshi AM, He FS, Estep PW, Bulyk ML: Compact, universal DNA microarrays to comprehensively determine transcriptionfactor binding site specificities. Nat Biotechnol 2006, 24(11):1429–35. 10.1038/nbt1246View ArticlePubMedPubMed CentralGoogle Scholar
 Stormo GD, Schneider TD, Gold L, Ehrenfeucht A: Use of the 'Perceptron' algorithm to distinguish translational initiation sites in E. coli. Nucleic Acids Research 1982, 10(9):2997–3011. 10.1093/nar/10.9.2997View ArticlePubMedPubMed CentralGoogle Scholar
 Rahmann S, Müller T, Vingron M: On the power of profiles for transcription factor binding site detection. Stat Appl Genet Mol Biol 2003, 2: Article7.PubMedGoogle Scholar
 Benos PV, Bulyk ML, Stormo GD: Additivity in proteinDNA interactions: how good an approximation is it? Nucleic Acids Res 2002, 30(20):4442–4451. 10.1093/nar/gkf578View ArticlePubMedPubMed CentralGoogle Scholar
 Bulyk ML, Johnson PLF, Church GM: Nucleotides of transcription factor binding sites exert interdependent effects on the binding affinities of transcription factors. Nucleic Acids Res 2002, 30(5):1255–1261. 10.1093/nar/30.5.1255View ArticlePubMedPubMed CentralGoogle Scholar
 Badis G, Berger MF, Philippakis AA, Talukder S, Gehrke AR, Jaeger SA, Chan ET, Metzler G, Vedenko A, Chen X, Kuznetsov H, Wang CF, Coburn D, Newburger DE, Morris Q, Hughes TR, Bulyk ML: Diversity and complexity in DNA recognition by transcription factors. Science 2009, 324(5935):1720–3. 10.1126/science.1162327View ArticlePubMedPubMed CentralGoogle Scholar
 Mustonen V, Kinney J, Callan CG, Lässig M: Energydependent fitness: a quantitative model for the evolution of yeast transcription factor binding sites. Proc Natl Acad Sci USA 2008, 105(34):12376–81. 10.1073/pnas.0805909105View ArticlePubMedPubMed CentralGoogle Scholar
 BenGal I, Shani A, Gohr A, Grau J, Arviv S, Shmilovici A, Posch S, Grosse I: Identification of transcription factor binding sites with variableorder Bayesian networks. Bioinformatics 2005, 21(11):2657–66. 10.1093/bioinformatics/bti410View ArticlePubMedGoogle Scholar
 Barash Y, Elidan G, Friedman N, Kaplan T: Modeling dependencies in proteinDNA binding sites. Proceedings of the seventh annual international conference 2003. [http://portal.acm.org/citation.cfm?id=640079]Google Scholar
 Sharon E, Lubliner S, Segal E, Stormo G: A FeatureBased Approach to Modeling ProteinDNA Interactions. PLoS Comput Biol 2008, 4(8):e1000154. 10.1371/journal.pcbi.1000154View ArticlePubMedPubMed CentralGoogle Scholar
 Maerkl SJ, Quake SR: A systems approach to measuring the binding energy landscapes of transcription factors. Science 2007, 315(5809):233–7. 10.1126/science.1131007View ArticlePubMedGoogle Scholar
 Schneider TD, Stephens RM: Sequence logos: a new way to display consensus sequences. Nucleic Acids Research 1990, 18(20):6097–100. 10.1093/nar/18.20.6097View ArticlePubMedPubMed CentralGoogle Scholar
 Osada R, Zaslavsky E, Singh M: Comparative analysis of methods for representing and searching for transcription factor binding sites. Bioinformatics 2004, 20(18):3516–25. 10.1093/bioinformatics/bth438View ArticlePubMedGoogle Scholar
 Sandelin A, Wasserman WW: Constrained binding site diversity within families of transcription factors enhances pattern discovery bioinformatics. J Mol Biol 2004, 338(2):207–215. 10.1016/j.jmb.2004.02.048View ArticlePubMedGoogle Scholar
 Bryne JC, Valen E, Tang MHE, Marstrand T, Winther O, da Piedade I, Krogh A, Lenhard B, Sandelin A: JASPAR, the open access database of transcription factorbinding profiles: new content and tools in the 2008 update. Nucleic Acids Res 2008, (36 Database):D102–6.Google Scholar
 Kielbasa SM, Gonze D, Herzel H: Measuring similarities between transcription factor binding sites. BMC Bioinformatics 2005, 6: 237. 10.1186/147121056237View ArticlePubMedPubMed CentralGoogle Scholar
 Mahony S, Auron PE, Benos PV: DNA Familial Binding Profiles Made Easy: Comparison of Various Motif Alignment and Clustering Strategies. PLoS Comput Biol 2007, 3(3):e61. 10.1371/journal.pcbi.0030061View ArticlePubMedPubMed CentralGoogle Scholar
 Pape UJ, Rahmann S, Vingron M: Natural Similarity Measures between Position Frequency Matrices with an Application to Clustering. Bioinformatics 2008, 24(3):350–7. 10.1093/bioinformatics/btm610View ArticlePubMedGoogle Scholar
 Habib N, Kaplan T, Margalit H, Friedman N, Fraenkel E: A Novel Bayesian DNA Motif Comparison Method for Clustering and Retrieval. PLoS Computational Biology 2008, 4(2):e1000010. 10.1371/journal.pcbi.1000010View ArticlePubMedPubMed CentralGoogle Scholar
 Garcia F, Lopez FJ, Cano C, Blanco A: FISim: a new similarity measure between transcription factor binding sites based on the fuzzy integral. BMC bioinformatics 2009, 10: 224. 10.1186/1471210510224View ArticlePubMedPubMed CentralGoogle Scholar
 Mahony S, Golden A, Smith TJ, Benos PV: Improved detection of DNA motifs using a selforganized clustering of familial binding profiles. Bioinformatics 2005, 21(Suppl 1):i283i291. 10.1093/bioinformatics/bti1025View ArticlePubMedGoogle Scholar
 Narlikar L, Hartemink AJ: Sequence features of DNA binding sites reveal structural class of associated transcription factor. Bioinformatics 2006, 22(2):157–163. 10.1093/bioinformatics/bti731View ArticlePubMedGoogle Scholar
 Narlikar L, Gordân R, Ohler U, Hartemink AJ: Informative priors based on transcription factor structural class improve de novo motif discovery. Bioinformatics 2006, 22(14):e384e392. 10.1093/bioinformatics/btl251View ArticlePubMedGoogle Scholar
 Xing EP, Karp RM: MotifPrototyper: a Bayesian profile model for motif families. Proc Natl Acad Sci USA 2004, 101(29):10523–10528. 10.1073/pnas.0403564101View ArticlePubMedPubMed CentralGoogle Scholar
 Matys V, KelMargoulis OV, Fricke E, Liebich I, Land S, BarreDirrie A, Reuter I, Chekmenev D, Krull M, Hornischer K, Voss N, Stegmaier P, LewickiPotapov B, Saxel H, Kel AE, Wingender E: TRANSFAC and its module TRANSCompel: transcriptional gene regulation in eukaryotes. Nucleic Acids Res 2006, (34 Database):D108D110. 10.1093/nar/gkj143Google Scholar
 PortalesCasamar E, Thongjuea S, Kwon AT, Arenillas D, Zhao X, Valen E, Yusuf D, Lenhard B, Wasserman WW, Sandelin A: JASPAR 2010: the greatly expanded openaccess database of transcription factor binding profiles. Nucleic Acids Research 2010, (38 Database):D105D110. 10.1093/nar/gkp950Google Scholar
 Newburger DE, Bulyk ML: UniPROBE: an online database of protein binding microarray data on proteinDNA interactions. Nucleic Acids Research 2009, (37 Database):D77D82. 10.1093/nar/gkn660Google Scholar
 AnthonyCahill SJ, Benfield PA, Fairman R, Wasserman ZR, Brenner SL, Stafford WF, Altenbach C, Hubbell WL, DeGrado WF: Molecular characterization of helixloophelix peptides. Science 1992, 255(5047):979–83. 10.1126/science.1312255View ArticlePubMedGoogle Scholar
 Kroeger PE, Morimoto RI: Selection of new HSF1 and HSF2 DNAbinding sites reveals difference in trimer cooperativity. Mol Cell Biol 1994, 14(11):7592–603.View ArticlePubMedPubMed CentralGoogle Scholar
 Minka TP: Estimating a Dirichlet distribution.2003. [http://research.microsoft.com/enus/um/people/minka/papers/dirichlet/minkadirichlet.pdf]Google Scholar
 Dogruel M, Down T, Hubbard T: NestedMICA as an ab initio protein motif discovery tool. BMC Bioinformatics 2008, 9: 19. 10.1186/14712105919View ArticlePubMedPubMed CentralGoogle Scholar
 Skilling J: Nested Sampling for General Bayesian Computation. 2004.Google Scholar
 Mahony S, Benos PV: STAMP: a web tool for exploring DNAbinding motif similarities. Nucleic Acids Res 2007, (35 Web Server):W253W258. 10.1093/nar/gkm272Google Scholar
 Down TA, Hubbard TJP: NestedMICA: sensitive inference of overrepresented motifs in nucleic acid sequence. Nucleic Acids Res 2005, 33(5):1445–1453. 10.1093/nar/gki282View ArticlePubMedPubMed CentralGoogle Scholar
 Tang MHE, Krogh A, Winther O: BayesMD: Flexible Biological Modeling for Motif Discovery. Journal of Computational Biology 2008, 15(10):1347–1363. 10.1089/cmb.2007.0176View ArticlePubMedGoogle Scholar
 Flicek P, Aken BL, Beal K, Ballester B, Caccamo M, Chen Y, Clarke L, Coates G, Cunningham F, Cutts T, Down T, Dyer SC, Eyre T, Fitzgerald S, FernandezBanet J, Gräf S, Haider S, Hammond M, Holland R, Howe KL, Howe K, Johnson N, Jenkinson A, Kähäri A, Keefe D, Kokocinski F, Kulesha E, Lawson D, Longden I, Megy K, Meidl P, Overduin B, Parker A, Pritchard B, Prlic A, Rice S, Rios D, Schuster M, Sealy I, Slater G, Smedley D, Spudich G, Trevanion S, Vilella AJ, Vogel J, White S, Wood M, Birney E, Cox T, Curwen V, Durbin R, FernandezSuarez XM, Herrero J, Hubbard TJP, Kasprzyk A, Proctor G, Smith J, UretaVidal A, Searle S: Ensembl 2008. Nucleic Acids Res 2008, (36 Database):D707–14.
 Breiman L: Random Forests. Machine Learning 2001, 45: 5–32. 10.1023/A:1010933404324View ArticleGoogle Scholar
 Nieto MA: The snail superfamily of zincfinger transcription factors. Nat Rev Mol Cell Biol 2002, 3(3):155–66. 10.1038/nrm757View ArticlePubMedGoogle Scholar
 Berger M, Badis G, Gehrke A, Talukder S, Philippakis A, Penacastillo L, Alleyne T, Mnaimneh S, Botvinnik O, Chan E: Variation in Homeodomain DNA Binding Revealed by HighResolution Analysis of Sequence Preferences. Cell 2008, 133(7):1266–1276. 10.1016/j.cell.2008.05.024View ArticlePubMedPubMed CentralGoogle Scholar
 Noyes MB, Christensen RG, Wakabayashi A, Stormo GD, Brodsky MH, Wolfe SA: Analysis of homeodomain specificities allows the familywide prediction of preferred recognition sites. Cell 2008, 133(7):1277–89. 10.1016/j.cell.2008.05.023View ArticlePubMedPubMed CentralGoogle Scholar
 Piipari M, Down TA, Saini H, Enright A, Hubbard TJ: iMotifs: an integrated sequence motif visualization and analysis environment. Bioinformatics 2010, btq026.Google Scholar
 Smit A, Hubley R, Green P: RepeatMasker. Open3.0 1996. [http://www.repeatmasker.org]Google Scholar
 Morgulis A, Gertz EM, Schäffer AA, Agarwala R: WindowMasker: windowbased masker for sequenced genomes. Bioinformatics 2006, 22(2):134–41. 10.1093/bioinformatics/bti774View ArticlePubMedGoogle Scholar
 Team RDC:R: A Language and Environment for Statistical Computing. 2007. [ISBN 3–900051–07–0] [http://www.Rproject.org].Google Scholar
 Liaw A, Wiener M: Classification and Regression by randomForest. R News 2002, 2(3):18–22.Google Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.