- Research article
- Open access
- Published:

# Fast selection of miRNA candidates based on large-scale pre-computed MFE sets of randomized sequences

*BMC Research Notes*
**volumeÂ 7**, ArticleÂ number:Â 34 (2014)

## Abstract

### Background

Small RNAs are important regulators of genome function, yet their prediction in genomes is still a major computational challenge. Statistical analyses of pre-miRNA sequences indicated that their 2D structure tends to have a minimal free energy (MFE) significantly lower than MFE values of equivalently randomized sequences with the same nucleotide composition, in contrast to other classes of non-coding RNA. The computation of many MFEs is, however, too intensive to allow for genome-wide screenings.

### Results

Using a local grid infrastructure, MFE distributions of random sequences were pre-calculated on a large scale. These distributions follow a normal distribution and can be used to determine the MFE distribution for any given sequence composition by interpolation. It allows on-the-fly calculation of the normal distribution for any candidate sequence composition.

### Conclusion

The speedup achieved makes genome-wide screening with this characteristic of a pre-miRNA sequence practical. Although this particular property alone will not be able to distinguish miRNAs from other sequences sufficiently discriminative, the MFE-based P-value should be added to the parameters of choice to be included in the selection of potential miRNA candidates for experimental verification.

## Background

Small RNAs are important molecules in the regulation of gene expression. Several classes of distinct small RNA molecules play vital roles in development, health and disease, as well as in many other biological pathways [1â€“4]. A particular class of regulatory small RNAs are the microRNA (miRNA) molecules. A miRNA is a ~20-23 nucleotide (nt) short, non-protein coding RNA. Together with several protein components, miRNAs reduce the amount of a target mRNA by physical interaction to notably the 3â€²-untranslated region (3â€²-UTR) of the mRNA, resulting in either degradation of that mRNA, or arrest of translation [4â€“6]. In rare cases, miRNAs can also upregulate expression [4, 7]. Well over 25 thousand miRNAs (miRBase Release 19; August 2012 [8]) have now been identified in many different species [9, 10].

The overall biogenesis of miRNAs is well established [4, 11], although details are still being discovered. In all cases except for intronic miRNAs [12], the miRNA is synthesized as a longer primary transcript known as primary miRNA (pri-miRNA), that is processed in the nucleus by the RNAse Drosha in animals and Dicer-like 1 in plants, to generate a precursor miRNA (pre-miRNA) of about 80â€“100 nt in animals, 60â€“300 nt in plants or 60â€“120 nt in (animal) viruses. The pre-miRNA sequence has degenerated palindromic sequence with the characteristic secondary structure of a stem-loop hairpin. The final verdict on the total number of miRNAs in a given genome is not out yet. The total count in Release 19 of miRBase is 25,141 for all organisms and many more miRNAs are described in the primary literature. Whereas the search for miRNAs in model genomes such as human or Arabidopsis will approach saturation, identification of the full miRNA complement in other genomes is still a challenge.

As mature miRNAs are only ~22 nt in length, straight-forward alignment-based heuristic methods such as BLAST are less suitable for identifying miRNAs and their targets in a given genome or transcriptome [5, 13]. The identification of miRNAs and their targets is therefore a challenge for computational pattern recognition [11, 14]. Computational methods for miRNA identification focus on the typical extended stem-loop hairpin structure of the pre-miRNA, which is characterized by helical base pairing with a few internal bulges in the stem. To identify the stem-loop miRNA precursor structure from a given sequence, RNA folding programs are used, such as mfold [15], its update UNAfold [16], or RNAfold (also known as the Vienna package [17, 18], to establish the minimal free energy (MFE) of the stem-loop structure.

Increasingly sophisticated computational approaches have been proposed for the identification of pre-miRNAs, the mature miRNA sequence and its presumed target(s) [19â€“21], many of which are available online [22]. Many approaches are based on supposed or derived characteristics of miRNA sequences or combinations thereof [23â€“26]. Although all miRNAs are thought to have such properties in common, not a single property individually seems able to distinguish miRNAs sufficiently accurately from other RNA molecules with sufficient accuracy [27]. Several approaches therefore include evolutionary conservation of miRNA sequences between different species [1, 28]. In these evolution-based strategies, species-specific and non -or less- conserved pre-miRNA molecules are likely to escape identification. Overall, methods available tend to show relatively high rates of false positives [22] and are possibly hampered by the use of inappropriate controls [29]. They generally result in lists too long to be feasible for experimental validation.

We here revisit a selective criterion proposed earlier, but largely unexplored because of computational costs. Statistical analyses of pre-miRNA hairpins indicated that such hairpins tend to have MFE values which are significantly lower than the MFE values based on randomized sequences with the same length and nucleotide composition, in contrast to other classes of RNA, such as transfer RNA, ribosomal RNA and messenger RNA [30â€“32]. In MFE analysis, the sequence composition of each candidate sequence is randomized and the MFE value based on the candidate is compared to the MFE distribution based on the randomized sequences. These data are used to calculate the probability that the MFE of the candidate is sufficiently small compared to randomized sequences [30]. This probability is here coined the empirical P-value (P_{E}). This P_{E} establishes a useful discriminating criterion for pre-miRNA identification. It is implemented in the MiPred prediction tool [33], that helps to decide for a single sequence whether it is a pre-miRNA hairpin. However, the computation of large numbers of MFE values per candidate sequence to be able to calculate P_{E} is computationally demanding, which precludes application to genome-wide analyses. Solutions proposed in the literature are a probabilistic implementation of the MFE computation [34] or asymptotic *Z*-scores of the MFE distribution based on precomputed tables [35]. We here present a novel approach that requires the computation of only the MFE based on the candidate sequence. This approach enables the routine evaluation of potential miRNA structures on a genome-wide scale that could be integrated as part of an existing approach for processing potential miRNA sequences [20, 36].

## Methods

### Data

The miRNA data set was downloaded from the miRbase repository [8â€“10] (releases 9.2 and 15), consisting of 4,584 and 15,172 pre-miRNA sequences respectively. The genomic sequence of the Epstein Barr virus type 1 [37] was downloaded from Genbank NCBI [gi|82503188|ref|NC_007605.1]. The test set with 250,000 random sequences was generated with a small C program.

### Hardware

Computations were performed on a 200â€‰+â€‰âˆ’node Debian Linux-based network. A dedicated server is running Network File System (NFS)-based software for file management and Condor software ([38]; version 7.6.1) for grid management [39].

### RNA folding software

The minimal free energy of a sequence was computed with a local implementation of the Hybrid software (version 2.5) of the UNAFold software package [16, 40]. UNAFold extends and replaces the earlier mfold application [15]. The software was adjusted to enhance the performance about three-fold by optimizing computation-intensive computational steps without changing the underlying algorithm. All RNA molecules were folded as single strands at 30Â°C, a sodium concentration of 1.0Â M and the option â€“E (energy only, no plots). In case of sequences that are not able to fold properly, the Hybrid software assigns an MFE ofâ€‰+â€‰âˆž.

### Randomization and visualization

Distribution fitting, P-values and other statistics were computed with the software suite R (version 2.7.1.) [41]. To randomize sequences while maintaining the nucleotide composition, the Fisher-Yates shuffling procedure for selection without replacement was implemented in C, with appropriate unbiased randomization [42]. For any candidate sequence, the empirical P-value P_{E} was computed as P_{E}â€‰=â€‰X/(Nâ€‰+â€‰1) [30], where X is the number of sequences with an MFE lower than or equal to the MFE based on the candidate sequence and N is the number of randomized sequences considered. In this study, N is taken as 1,000, in correspondence with an earlier study [30]. As a consequence, the lower bound of P_{E} is zero (for Xâ€‰=â€‰0) and the next lowest value is 0.000999 (for Xâ€‰=â€‰1). There are no additional assumptions necessary with respect to the shape of the distribution of the MFE values [30]. The computed MFE values based on the randomized sequences were transformed into a normal (Gaussian) distribution defined by the mean and standard deviation of the MFE values. The normal distribution-derived P_{N} of the MFE based on the given candidate sequence is being computed using the mean and standard deviation of that distribution. Results were visualized with R and MatLab (release 13).

### Multidimensional interpolation

A database of entry RNA sequences, with a length of 50 to 300 nt and a step size of 5 nt, was generated by computer. This range covers the length of most known pre-miRNAs, except for some plant miRNAs [43]. For each sequence length, the nucleotide composition of the sequence was varied in such a way that each of the four nucleotides occurs at least once (for sequencesâ€‰<â€‰100 nt) or at least at 1% (for sequencesâ€‰>â€‰100 nt). Per sequence length, individual sequences were generated with a step size for an individual nucleotide of 2%, except in the range from 20-70% for an individual nucleotide where a step size of 1% was used. The procedure in numbers is as follows: for a population of sequences with a length of 50nt, the first nucleotide composition consists of 1% A, 1% U, 1% C and 97% G. In the next step the composition is 2% A, 1% U, 1% C and 96%Â G and so on. Then the length is increased to 55 nt and the procedure is repeated for the nucleotide composition, etc. This procedure generated a set of 1.4 Ã— 10^{6} entry sequences. For each of the individual entry sequences, a sequence set of thousand randomized shuffles was generated by Fisher-Yates randomization [42]. This procedure represents a selection without replacement, therefore maintains the nucleotide composition (mononucleotide shuffling). Sequence sets in which one or more shuffled sequences had an MFE ofâ€‰+â€‰âˆž were discarded and only the sequence sets with 1,000 MFE values were considered to maintain statistical validity. This way, a total of 1.05 Ã— 10^{6} sequence sets were generated. For each population, the mean MFE and standard deviation were computed and stored in a MySQL database together with the sequence composition in absolute nucleotide counts. To calculate the mean and standard deviation for any candidate sequence, an interpolation algorithm was implemented in C++ using sparse matrix data management for optimal memory use [44]. A sparse matrix contains only the values of interest and all zero or unknown values are not stored. The resulting data structure contains only the nucleotide composition analysed and not all possible compositions, therefore the data can be stored in memory and searched efficiently. The Hybrid software used for RNA folding [16] was integrated within this application to enhance performance.

### Sliding window analysis

To analyse whole genomes for the presence of potential pre-miRNA candidates using the pre-computed MFE data outlined above, a sliding window approach was implemented in C++. The smallest window length was set at 50 nt, incremented with a step size of 10 nt to a maximum of 300 nt. For each window length, the step size for sliding was set at 10% of the window length. For each window, the MFE was computed and the nucleotide composition of the sequence was determined. Based on the sequence composition, the appropriate mean and standard deviation were estimated by interpolation (see Results) using the data search space generated. The normal distribution function was used to calculate P_{N} of the MFE of the window.

## Results and discussion

In the identification of potential pre-miRNA candidates in genomic sequences, the MFE based on the sequence relative to the distribution of random sequences with the same nucleotide composition is a potentially valuable criterion. However, the estimation of the empirical P_{E} as parameter for the distance between the MFE based on a candidate sequence and the MFEs of randomized sequences is computationally intensive. It requires the computation of the MFE for all randomized sequences. To use the MFE distribution as criterion more comfortably, computations should be considerably faster. We here show the feasibility of the use of the normal distribution for the computation of P_{N} as approximation of P_{E} and for the interpolation of the distribution for any given sequence with the help of pre-computed MFE distributions of random sequences.

### Pre-computed MFE distributions of random sequences

A total of 1.4 Ã— 10^{6} entry sequences covering the length classes representative for most known pre-miRNA (50 â€“ 300 nt), were generated. Each entry sequence was shuffled 1,000 times and based on each of the generated sequences the MFE was calculated giving a total of 1,053,248 populations, each consisting of 1,000 random sequences. In 346,752 generated populations one or more random sequence could not fold properly. When the hybrid software is not able to give a stable structure, the random sequence is considered not to fold properly and is therefore not included because it skews the data. For a single sequence on a standard desktop PC, the MFE computation by the Hybrid software requires approximately 0.2Â sec CPU time. The 1.4 Ã— 10^{6} Ã— 1,000 computations would therefore have taken about 8.8 CPU years on a standard PC. Using idle CPU cycles on our grid, it took about 2 months grid time to complete all computations. All MFE values were computed for an annealing temperature of 30Â°C, but as MFE values and distributions change in a linear way with temperature (results not shown), the approach presented and data generated are, if so desired, suitable for, or comparable with, other folding temperatures.

Randomized sequence sets can reasonably be considered to reflect a normal distribution. The examples for sets with 25% nucleotide composition are shown in FigureÂ 1. Other compositions give similar results (data not shown). Such a normal distribution was demonstrated earlier for randomized sequences [45], although the distribution may not be an exact Gaussian distribution [34]. The MFE data of random sequences are therefore suitable for deriving the normal estimate P_{N} of P_{E}, based on mean, standard deviation and the normal distribution function. This way, P_{N} is equivalent to the *Z*-score of the MFE, defined as the number of standard deviations by which the MFE based on a candidate sequence deviates from the mean MFE of the set of shuffled sequences [31, 45].

For each sequence set, the mean and standard deviation was stored in a database together with the sequence composition. An example of the distribution of the mean MFE value of all sequence sets of 100 nt in length with different sequence compositions is shown in FigureÂ 2. The 3D contour plot shows that the sets of sequences with high percentages of C and G nucleotides have low mean MFE values, which reflects the higher energy in C-G pairing. RNA molecules with an abundance of for example A and G are much less likely to form a stable structure and the set of 1,000 random sequences will therefore have a high mean MFE. The plot shows that the mean MFE values decrease in an almost linear fashion from the low values for sequences with high C and G compositions to the outer edges.

### Multidimensional interpolation for candidate sequences

For the on-the-fly computation of the MFE distribution based on a given candidate sequence, the pre-computed data are used for multidimensional interpolation. For each candidate sequence, the composition of the sequence is determined by counting nucleotides. Sequence compositions with a squared Euclidean distance up to 5 in the surrounding search space are identified: the length of the sequence is therefore not taken into account. This value was selected on the basis of the analysis of known miRNAs. These analyses showed this threshold gives the smallest difference in P-value (data not shown) when comparing the P_{N} to the P_{E} of mirbase entries. For sequence compositions that have no points within this distance no prediction can be made and a P_{N} of 1.0 is given. From the selected near-by sequences, the mean and standard deviations are retrieved from the database. For the candidate sequence, both mean and standard deviation of the MFE distribution are determined by interpolation using the data from the nearby sequence compositions, weighted based on their Euclidean distance to the candidate sequence. The sum of the weighted values gives the estimated mean and standard deviation of the MFE distribution based on the randomized sequences from the candidate sequence. Mathematically, the formulae to derive the estimated average *Î¼*_{
e
} are expressed as:

where *w*_{
i
} is the weight per data point based on Euclidean distance, *d*_{
i
} is the distance per point, for which x_{i} and y_{i} are the nucleotide counts of the sequence in the search space and *d*_{
t
} is the total distance over N points. N varies per candidate sequence. Even in the case were the distance to a point is zero (d_{i}â€‰=â€‰0), more points are used to estimate the population average. Testing on sequences with the same compositions during computations would slow the software down and this situation is unlikely therefore it was not included in the software.

The use of P_{N} as normal approximation of P_{E} was evaluated by comparing both probabilities for different sequences. In FigureÂ 1, the comparison between many P_{E} (green) and P_{N} (red) is shown for a range of sequences with different lengths but the same nucleotide compositions. Other compositions give similar results (data not shown). The excellent goodness-of-fit demonstrates the suitability of the normal approximation P_{N} as criterion for the evaluation of pre-miRNA candidate sequences.

The estimation of the standard deviation of the MFE distribution based on the candidate sequence is based on the approach for estimating the mean as described in the previous section. The mean and standard deviation uniquely define the normal distribution function of the candidate sequence. With the two values, P_{N} is computed as the normal probability of MFE values smaller than the MFE based on the candidate sequence. This way, for each candidate sequence, only the MFE of the structure based on this sequence needs to be computed, speeding up computations approximately a thousand-fold when thousand shuffled sequences are used. As the calculations of the estimated mean, standard deviation and the P-value based on this normal distribution take time as well, the software is at least several hundred times faster for short sequences and faster for long candidates: the Hybrid software used is slower for longer sequences, as there are more secondary structures. Calculating the structures of 1000 candidates takes therefore considerably more time than the estimation process. Based on the running time of an example run it would take over 260 seconds to calculate 1000 MFE values. The calculation of P_{N} takes approximate a second, including the calculation of the MFE.

We evaluated the performance of P_{N} compared to P_{E} for selection with respect to the entries in the MiRBase registry. In FigureÂ 3, the distribution of P_{E} over the pre-miRNA molecules as published previously [30] is compared with the P_{E} computed of the current pre-miRNAs from miRbase with the same method [30] and the P_{N} as estimated by interpolation. It shows that the interpolation approach performs well. The difference between P_{E} and P_{N} reflects that the P_{N} distribution is continuous, whereas with 1,000 randomizations, the P_{E} distribution is discrete with a step size of 1/1001â€‰=â€‰0.000999. Although also P_{N} is estimated on the basis of 1,000 randomizations, the continuity of the distribution allows more strict settings for P_{N} and allows a more sensitive ranking in the lower P-value ranges. In TableÂ 1, the percentages of pre-miRNAs that conform to given settings of the P-value are shown. With a threshold of P_{N}â€‰=â€‰1Ã—10^{-4}, about 66.8% of all known pre-miRNAs are characterized by an MFE value well outside the distribution of MFE values of randomized sequences. Only 1% could not be estimated: the sequence was either too long or had no populations in the data set within the given distance.

To verify the performance of the applications on random sequences, a test set of 250,000 sequences was generated; all of different lengths and composition. The MFE and P_{N} were calculated for each of these sequences. The calculations were finished in 20 minutes. In TableÂ 1 the results are shown. Of these random sequences, 4% had no stable structure and hence no MFE and 17% had no populations in the data set within the given distance. Of the remaining sequences only 3% had a P_{N}â€‰<â€‰0.05.

### Shuffling inconsistencies

In the analyses above, a mononucleotide randomization method (Fisher-Yates algorithm) was used [42], whereas in the literature a dinucleotide randomization method was recommended and used [30, 31, 46]. In genome-wide analyses of candidate sequences based on P_{N}, we observed that several candidate sequences behaved oddly: whereas dinucleotide shuffling yielded P_{N}â€‰=â€‰0,98, reflecting not a likely candidate, mononucleotide shuffling as performed here resulted in a P_{N}â€‰<â€‰< 0.001, indicating a possible candidate. An example of such a sequence is given in FigureÂ 4, which shows a predicted hairpin structure for this sequence. To prevent such sequences interfering with the analysis of the distribution, the mononucleotide randomization method was used.

### Added value for miRNA prediction

Having validated the P_{N} interpolation method with known miRNAs, we now show the added value for whole genome screening. We have evaluated a small viral genome for putative pre-miRNAs regions. According to miRBase (both in release 15 and 19), this viral genome has 25 known pre-miRNA sequences. Of the 25 known Epstein-Barr virus (EBV) miRNAs, 24 have a P_{N}â€‰<â€‰0.05 with 22 having a P_{N}â€‰<â€‰= 0.001 (TableÂ 1). Both strands of the dsDNA genome sequence of the human Epstein-Barr virus type 1 [37] were converted into RNA and investigated for potential pre-miRNA sequence. For each of the total 566,988 windows of length 50â€“230 nt, the MFE and the P_{N} were computed. In contrast to the test set with random sequences, in EBV only 0.05% of the windows could not be estimated due to no sequence compositions within the given distance or because the sequence did not have a Stable 2D structure. This shows that the application performs very well for viral genomic DNA. The percentage of windows with a P_{N}â€‰<â€‰=0.001 is higher than in the test set with random sequences (TableÂ 1). There is also the effect of overlapping windows: a pre-miRNA of length 150 will be found in several windows of length 200. Many of these candidate windows are in repeat regions (FigureÂ 5). These windows can be discarded as not being viable locations for miRNAs: there are no known miRNAs within the EBV repeat regions. Although current research shows that in some organisms miRNAs can be found in repeat regions [47], we suggest inspection of other regions first to limit the number of relevant candidate regions.

To visualize regions of interest, the windows with a P_{N}â€‰<â€‰= 0.001 are placed in a separate data set and marked with a value of one. The windows of different lengths are then combined in the Integrated Genome Browser [48] (FigureÂ 5). With 19 different window lengths, the maximum of the resulting graph is 19. This indicates that all windows covering this location have a P_{N}â€‰<â€‰=0.001. The peaks in the graph show regions of interest which require further research. The graph shows 18 regions-of-interest in the plus strand where 9 or more windows have P_{N}â€‰<â€‰= 0.001. Using these selection criteria, the regions of 12 known miRNAs are found (FigureÂ 5). Using less than 9 windows will give more regions-of-interest and will also show more known miRNA regions, but will introduce more false positives as well. The analysis of the EBV genome shows that a (small) whole genome screening using P_{N}-estimation results in a limited number of regions-of-interest for further investigation.

## Conclusion

Previous research has indicated that the MFE based on a miRNA sequence is significantly lower than the MFE based on shuffled sequences with the same composition, in contrast to the MFE of other non-coding RNAs [30, 31, 49]. As the computation of an MFE is demanding, this characteristic of miRNAs precludes genome screening of sequences for their MFE distribution. With thousand randomizations per candidate sequence, the genome-wide screening of a million (10^{6}) candidates would require a billion (10^{9}) computations. These would take well over six year to finish on a current standard desktop computer.

We have presented a method to speed up analyses of the MFE distribution considerably, based on the normal approximation of pre-calculated MFE distributions based on random sequences, combined with a fast implementation of a multidimensional interpolation of distributions in sequence space. The data cover the search space for all RNA molecules with a length from 50 to 300 nt, in total roughly equaling the sum over 4^{i} for iâ€‰=â€‰50â€¦.300â€‰â‰ˆâ€‰5.5.10^{180} sequences. With three data points per sequence (mean, standard deviation and composition), this would generate an immense database, whereas the resulting data space here established is based on 1.1 Ã— 10^{6} sequences and takes about 30Â Mb. The latter is easily handled by standard amounts of RAM. The results show that although the newer miRNAs added to miRBase since 2006 seems to comply somewhat less with this criterion than the miRNAs analyzed before [50], the new approach developed here performs well on known pre-miRNAs (FigureÂ 3).

Sequence sets of 1,000 with at least one non-folding member were discarded. Yet, it could be argued that higher accuracy would be gained with more sets. The data is well distributed over the sequence data space (FigureÂ 2). The interpolation of MFE distributions is based on a threshold of the Euclidian distance of the surrounding data points. This implies that for different candidate sequences different amounts of pre-computed data are used to estimate the MFE distribution. This prevents interpolation issues at the boundaries of the data space where less points are available. The data reduction and interpolation results in considerably faster computation of the likelihood that the MFE of the sequence is markedly lower than equivalent randomized sequences. This obviates the need for on-the-fly computation of the MFE values based on the randomized sequences.

The particular type and number of randomizations is an issue. Whereas it was thought to be important to maintain not only the mononucleotide compositions, but also the dinucleotide distribution [46], the results shown for the behavior of miRNAs in either way of shuffling [30, 51] indicate no relevant difference, or even a slightly better performance of mononucleotide shuffling. These findings indicate that for miRNA prediction dinucleotide shuffling is not more optimal than mononucleotide shuffling. This is in agreement with the demonstration that all base pairings in an RNA molecule should be taken into account [52]. There is, in addition, uncertainty over the quality of the dinucleotide shuffling algorithm [35, 51]. As demonstrated here, particular sequences behave oddly with respect to dinucleotide shuffling (FigureÂ 4) and may distort the distribution derived from the computed MFE values. Inspection of such sequences indicated that these sequences contain a particular combination of repeat units in such a way that the dinucleotide shuffling is not changing the sequence in terms of MFE distribution. As a result, the candidate MFE is part of the distribution of shuffled sequences. As Fisher-Yates shuffling is the most random, this would seem to be the better method. We have followed the earlier recommendation of performing at least 1,000 randomizations [30], whereas other investigations use 500 [31] or 10,000 [51]. As few as 100 randomizations were recommended as sufficient to establish a reasonable Gaussian distribution [45].

In view of the gain in computing speed accomplished with P_{N}, it has become feasible to consider genome-wide screenings for pre-miRNA candidates based on P_{N}*.* The analyses here presented for the relatively small Epstein Barr virus demonstrate that indeed such analysis is now within reach. For a human genome, however, the approach will still ask a considerable computational effort. Moreover, the MFE alone is not able to distinguish miRNAs from other sequences sufficiently discriminative: it has to be integrated with other parameters. The P_{N} approach presented here can therefore be better implemented as part of, or next to, other approaches [20, 22]. Such approach would generate added value for such miRNA identification algorithms or pipelines. The application of this criterion will add to enhanced selectivity of miRNA discovery pipelines and help to limit the number of candidates for experimental validation and confirmation.

The advent of high throughput DNA sequencing technologies were shown to be particularly suitable for the analyses of the small RNA complement of RNA populations [4]. The identification of true miRNAs in such data sets is still a challenge to which the P_{N} analysis may contribute. The possibility of a one-time effort to pre-compute sequence parameters that will facilitate future analyses should be considered an approach that could generate considerable added value for larger grid environments in future bioinformatics.

## References

Chapman EJ, Carrington JC: Specialization and evolution of endogenous small RNA pathways. Nat. Rev. Genet. 2007, 8: 884-896. 10.1038/nrg2179.

Almeida MI, Reis RM, Calin GA: MicroRNA history: Discovery, recent applications, and next frontiers. 2011, Res: Mutat

Abbott AL: Uncovering new functions for microRNAs in Caenorhabditis elegans. Curr. Biol. 2011, 21: R668-R671. 10.1016/j.cub.2011.07.027.

Pasquinelli AE: MicroRNAs and their targets: recognition, regulation and an emerging reciprocal relationship. Nat. Rev. Genet. 2012, 13: 271-282.

Bartel DP: MicroRNAs: Target Recognition and Regulatory Functions. Cell. 2009, 136: 215-233. 10.1016/j.cell.2009.01.002.

Bartel DP: MicroRNAs: genomics, biogenesis, mechanism, and function. Cell. 2004, 116: 281-297. 10.1016/S0092-8674(04)00045-5.

Vasudevan S, Tong Y, Steitz JA: Switching from repression to activation: MicroRNAs can up-regulate translation. Science. 2007, 318 (80): 1931-1934.

MirBase: [http://www.mirbase.org]

Griffiths-Jones S, Saini HK, van Dongen S, Enright AJ: miRBase: tools for microRNA genomics. Nucleic Acids Res. 2008, 36: D154-D158. 10.1093/nar/gkn221.

Kozomara A, Griffiths-Jones S: miRBase: integrating microRNA annotation and deep-sequencing data. Nucleic Acids Res. 2011, 39: D152-D157. 10.1093/nar/gkq1027.

Ghosh Z, Chakrabarti J, Mallick B: miRNomics-The bioinformatics of microRNA genes. Biochem. Biophys. Res. Commun. 2007, 363: 6-11. 10.1016/j.bbrc.2007.08.030.

Westholm JO, Lai EC: Mirtrons: microRNA biogenesis via splicing. Biochimie. 2011, 93: 1897-1904. 10.1016/j.biochi.2011.06.017.

Freyhult EK, Bollback JP, Gardner PP: Exploring genomic dark matter: A critical assessment of the performance of homology search methods on noncoding RNA. Genome Res. 2007, 17: 117-125.

Lindow M, Gorodkin J: Principles and limitations of computational microRNA gene and target finding. DNA Cell Biol. 2007, 26: 339-351. 10.1089/dna.2006.0551.

Zuker M: Mfold web server for nucleic acid folding and hybridization prediction. Nucleic Acids Res. 2003, 31: 3406-3415. 10.1093/nar/gkg595.

Markham NR, Zuker M: DINAMelt web server for nucleic acid melting prediction. Nucleic Acids Res. 2005, 33: W577-W581. 10.1093/nar/gki591.

Hofacker IL: Vienna RNA secondary structure server. Nucleic Acids Res. 2003, 31: 3429-3431. 10.1093/nar/gkg599.

Gorodkin J, Hofacker IL: From Structure Prediction to Genomic Screens for Novel Non-Coding RNAs. PLoS Comput. Biol. 2011, 7: e1002100-10.1371/journal.pcbi.1002100.

Oulas A, Karathanasis N, Louloupi A, Poirazi P: Finding cancer-associated miRNAs: methods and tools. Mol. Biotechnol. 2011, 49: 97-107. 10.1007/s12033-011-9416-4.

Sarker R, Bandyopadhyay S, Maulik U: An Overview of Computational Approaches for Prediction of miRNA Genes and their Targets. Curr. Bioinform. 2011, 6: 15-

Krzyzanowski PM, Muro EM, Andrade-Navarro MA: Computational approaches to discovering noncoding RNA. Wiley Interdiscip. Rev. RNA. 2012, 3: 567-579. 10.1002/wrna.1121.

Tan Gana NH, Victoriano AFB, Okamoto T: Evaluation of online miRNA resources for biomedical applications. Genes Cells. 2012, 17: 11-27. 10.1111/j.1365-2443.2011.01564.x.

Zheng Y, Hsu W, Lee ML, Wong L: Exploring essential attributes for detecting MicroRNA Precursors from background sequences. Lect. Notes Bioinforma. 2006, 4316: 131-145.

Van der Burgt A, Fiers MWJE, Nap J-P, van Ham RCHJ: In silico miRNA prediction in metazoan genomes: balancing between sensitivity and specificity. BMC Genomics. 2009, 10: 204-10.1186/1471-2164-10-204.

Tempel S, Tahi F: A fast ab-initio method for predicting miRNA precursors in genomes. Nucleic Acids Res. 2012, 40: e80-10.1093/nar/gks146.

Liu X, He S, SkogerbÃ¸ G, Gong F, Chen R: Integrated sequence-structure motifs suffice to identify microRNA precursors. PLoS One. 2012, 7: e32797-10.1371/journal.pone.0032797.

Bentwich I: Identifying human microRNAs. Curr. Top. Microbiol. Immunol. 2008, 320: 257-269.

Lindow M, Jacobsen A, Nygaard S, Mang Y, Krogh A: Intragenomic matching reveals a huge potential for miRNA-mediated regulation in plants. PLoS Comput Biol. 2007, 3: e238-10.1371/journal.pcbi.0030238.

Ritchie W, Gao D, Rasko JEJ: Defining and providing robust controls for microRNA prediction. Bioinformatics. 2012, 28: 1058-1061. 10.1093/bioinformatics/bts114.

Bonnet E, Wuyts J, Rouze P, Van de Peer Y: Evidence that microRNA precursors, unlike other non-coding RNAs, have lower folding free energies than random sequences. Bioinformatics. 2004, 20: 2911-2917. 10.1093/bioinformatics/bth374.

Freyhult E, Gardner PP, Moulton V: A comparison of RNA folding measures. BMC Bioinformatics. 2005, 6: 241-10.1186/1471-2105-6-241.

Ng KLS, Mishra SK: De novo SVM classification of precursor microRNAs from genomic pseudo hairpins using global and intrinsic folding measures. Bioinformatics. 2007, 23: 1321-1330. 10.1093/bioinformatics/btm026.

Jiang P, Wu H, Wang W, Ma W, Sun X, Lu Z: MiPred: classification of real and pseudo microRNA precursors using random forest prediction model with combined features. Nucleic Acids Res. 2007, 35: W339-W344. 10.1093/nar/gkm368.

Rivas E, Eddy SR: Secondary structure alone is generally not statistically significant for the detection of noncoding RNAs. Bioinformatics. 2000, 16: 583-605. 10.1093/bioinformatics/16.7.583.

Clote P, Ferre F, Kranakis E, Krizanc D: Structural RNA has lower folding energy than random RNA of the same dinucleotide frequency. RNA. 2005, 11: 578-591. 10.1261/rna.7220505.

Gomes CPC, Cho J-H, Hood L, Franco OL, Pereira RW, Wang K: A Review of Computational Tools in microRNA Discovery. Front. Genet. 2013, 4: 81-

De Jesus O, Smith PR, Spender LC, Karstegl CE, Niller HH, Huang D, Farrell PJ: Updated Epstein-Barr virus (EBV) DNA sequence and analysis of a promoter for the BART (CST, BARFO) RNAs of EBV. J. Gen. Virol. 2003, 84: 1443-1450. 10.1099/vir.0.19054-0.

Condor software website: [http://www.cs.wisc.edu/condor]

Thain D, Tannenbaum T, Livny M: Distributed computing in practice: The Condor experience. Conc Comp Pr. Exp. 2005, 17: 323-356. 10.1002/cpe.938.

UnaFold Package: [http://mfold.rna.albany.edu/?q=DINAMelt/software]

R Project: [http://www.r-project.org]

Black PE: Fisher-Yates shuffle. 2005, National Institute of Standards and Technology: In Dict. Algorithms Data Struct. edited by Black PE U.S

Thakur V, Wanchana S, Xu M, Bruskiewich R, Quick WP, Mosig A, Zhu X-G: Characterization of statistical features for plant microRNA prediction. BMC Genomics. 2011, 12: 108-10.1186/1471-2164-12-108.

Arnold G, HÃ¶lzl J, KÃ¶ksal AS, Berkeley UC: Specifying and Verifying Sparse Matrix Codes. 2010, Discovery, 1-13.

Le SY, Maizel JV: A method for assessing the statistical significance of RNA folding. J. Theor. Biol. 1989, 138: 495-510. 10.1016/S0022-5193(89)80047-5.

Workman C, Krogh A: No evidence that mRNAs have lower folding free energies than random sequences with the same dinucleotide distribution. Nucleic Acids Res. 1999, 27: 4816-4822. 10.1093/nar/27.24.4816.

Zhao Y, Xu H, Yao Y, Smith LP, Kgosana L, Green J, Petherbridge L, Baigent SJ, Nair V: Critical role of the virus-encoded microRNA-155 ortholog in the induction of Marekâ€™s disease lymphomas. PLoS Pathog. 2011, 7: e1001305-10.1371/journal.ppat.1001305.

Integrated Genome Browser: [http://bioviz.org/igb/]

Niu QW, Lin SS, Reyes JL, Chen KC, Wu HW, Yeh SD, Chua NH: Expression of artificial microRNAs in transgenic Arabidopsis thaliana confers virus resistance. Nat. Biotechnol. 2006, 24: 1420-1428. 10.1038/nbt1255.

Bonnet E, Van De Peer Y, Rouze P: The small RNA world of plants. New Phytol. 2006, 171: 451-468. 10.1111/j.1469-8137.2006.01806.x.

Ng KLS, Mishra SK: Unique folding of precursor microRNAs: quantitative evidence and implications for de novo identification. RNA. 2007, 13: 170-187.

Parisien M, Major F: The MC-Fold and MC-Sym pipeline infers RNA structure from sequence data. Nature. 2008, 452: 51-55. 10.1038/nature06684.

## Acknowledgements

We would like to thank Piet Plomp, MSc and Marcel Kempenaar, BASc for help with the computer grid, Dr. Peter Terpstra (Department of Genetics, University Medical Center Groningen, The Netherlands) and Rudi van Bavel BASc (now at Keygene NV) for sharing ideas and Dr. Mark Fiers at Plant Research International, Wageningen University and Research Centre, Wageningen, The Netherlands (now at VIB Center for the Biology of Disease, KU Leuven, Belgium), for valuable discussion and input. This research was funded in part by a PhD fellowship (SW) from Hanze University of Applied Sciences Groningen.

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Competing interests

The authors declare that they have no competing interests.

### Authorsâ€™ contributions

SW invented the prediction method, performed most of the data analyses, including the EBV analyses, wrote the software and the manuscript. SB and IM created part of the data set and performed quality checks. MN and WK provided statistical and biological interpretations and analyses. JPN directed the research, provided additional biological interpretations and was involved in drafting the manuscript. All authors contributed to, read and approved the manuscript.

## Authorsâ€™ original submitted files for images

Below are the links to the authorsâ€™ original submitted files for images.

## Rights and permissions

**Open Access**
This article is published under license to BioMed Central Ltd. This is an Open Access article is distributed under the terms of the Creative Commons Attribution License (
https://creativecommons.org/licenses/by/2.0
), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## About this article

### Cite this article

Warris, S., Boymans, S., Muiser, I. *et al.* Fast selection of miRNA candidates based on large-scale pre-computed MFE sets of randomized sequences.
*BMC Res Notes* **7**, 34 (2014). https://doi.org/10.1186/1756-0500-7-34

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/1756-0500-7-34