Skip to main content

Improvement in the prediction of the translation initiation site through balancing methods, inclusion of acquired knowledge and addition of features to sequences of mRNA

Abstract

Background

The accurate prediction of the initiation of translation in sequences of mRNA is an important activity for genome annotation. However, obtaining an accurate prediction is not always a simple task and can be modeled as a problem of classification between positive sequences (protein codifiers) and negative sequences (non-codifiers). The problem is highly imbalanced because each molecule of mRNA has a unique translation initiation site and various others that are not initiators. Therefore, this study focuses on the problem from the perspective of balancing classes and we present an undersampling balancing method, M-clus, which is based on clustering. The method also adds features to sequences and improves the performance of the classifier through the inclusion of knowledge obtained by the model, called InAKnow.

Results

Through this methodology, the measures of performance used (accuracy, sensitivity, specificity and adjusted accuracy) are greater than 93% for the Mus musculus and Rattus norvegicus organisms, and varied between 72.97% and 97.43% for the other organisms evaluated: Arabidopsis thaliana, Caenorhabditis elegans, Drosophila melanogaster, Homo sapiens, Nasonia vitripennis. The precision increases significantly by 39% and 22.9% for Mus musculus and Rattus norvegicus, respectively, when the knowledge obtained by the model is included. For the other organisms, the precision increases by between 37.10% and 59.49%. The inclusion of certain features during training, for example, the presence of ATG in the upstream region of the Translation Initiation Site, improves the rate of sensitivity by approximately 7%. Using the M-Clus balancing method generates a significant increase in the rate of sensitivity from 51.39% to 91.55% (Mus musculus) and from 47.45% to 88.09% (Rattus norvegicus).

Conclusions

In order to solve the problem of TIS prediction, the results indicate that the methodology proposed in this work is adequate, particularly when using the concept of acquired knowledge which increased the accuracy in all databases evaluated.

Background

Transcription and translation are the means by which the cells interpret and express their genetic information [1]. Only part of the transcribed sequences carries information to codify proteins (CDS -CoDing Sequence). In other words, even though mRNA can be translated in its entirety, only a section of this mRNA is translated into amino acid [2]. Therefore, given a molecule of mRNA, a central problem of molecular biology is to determine whether it contains CDS and thereafter to discover which protein will be codified. The region of the mRNA sequence where the initiation of the protein synthesis process occurs is called the Translation Initiation Site (TIS).

Control of the initiation of translation is one of the most important processes in the regulation of genetic expression [3]. Thus, determining the TIS is not a trivial task; it is of great relevance for genetic inference. A high level of accuracy of prediction could be useful for a better understanding of the protein obtained from the sequences of nucleotides [4].

Normally, translation begins in the first ATG of the mRNA molecule that has an appropriate context [5], but can begin in a different codon [6]. Depending on the position of the synthesis initiation in the mRNA strand, the triplet of nucleotides selected for the synthesis can vary, also altering the amino acids generated. The lack of knowledge about the preservative features in the process of identifying the initiation of translation makes the prediction of the TIS a complex task. For this reason, computational methods which identify patterns can be used with the aim of extracting the implicit knowledge involved in this process [2]. Since 1982, the prediction of the TIS has been studied extensively using biological methods, statistics and computational techniques [1]. Initially, statistical methods were exploited with the aim of discovering patterns in positive sequences. The pioneering work of Kozak [5], a statistical analysis of the sequences of 211 mRNAs of eukaryotic cells, revealed that some positions in the sequences of mRNAs, relative to the TIS, are very stable, determining the Kozak consensus [5], gcc[a/g]ccatg[g], where there is a predominance of these nucleotides in positions -3 and +4.

Another statistical analysis was conducted by Cavener et. al [7] on the Start codon (the codon which initiates translation) and the Stop codons (codons which finalize translation), and an algorithm was developed to analyze the frequency of the nucleotides and the multiple positions of the nucleotides. In the work developed by Kozak [5], a proportion of 79% of Adenine (A) in position -3 was identified (and 18% of G) while Cavener et. al [7], using 2,595 vertebrate sequences, obtained a 58% probability of A being in the aforementioned position.

Nakagawa et. al [3] conducted comparative analyses between 47 species, including animals, fungi, plants and protists, revealing the existence of consensus for different species. Based on this analysis, the following regions of consensus were identified: the presence of a purine (A or G) in position -3, the presence of A or C in position -2, the presence of C in position +5. The position -3 had already been discovered by Kozak [5] and was confirmed by this study.

Different computational methods have been applied to the prediction of the TIS including Artificial Neural Networks (ANN) [8, 9], Support Vector Machines (SVM) [2, 10, 11] and the Gaussian Model [12]. Utilizing Artificial Neural Networks, Stormo et. al [8] classified the sequences of Escherichia coli using codification of 4 bits (A=1000, C=0100, G=0010, T=0001) and windows of 51, 71 and 101 nucleotides centered on ATG. Pedersen and Nielsen [9], however, trained Artificial Neural Networks using a database of vertebrates which was processed to obtain the correspondent sequences of mRNA. Of these sequences, only those with the TIS annotated and with at least 10 nucleotides in the upstream region and at least 150 in the downstream region were selected. The resultant base had 13,502 ATGs, 3,312 (24.5%) being TIS and the other 10,190 (75.4%) being non-TIS. In this study, windows of 13, 33, 53, 73, 93, 113, 133, 153, 173 and 203 nucleotides centered on ATG were used. The codification used was the same as that of Stormo et. al [8] - binary of 4 bits. Pedersen and Nielsen [9] obtained sensitivity, specificity and accuracy of 78%, 87% and 85%, respectively. The authors also conducted an analysis of the sequences to reveal that features are important for distinguishing TIS from non-TIS. It was discovered that position -3 is crucial in the identification of the TIS and this corroborates with the other studies cited.

Hatzigeorgiou [6] also used ANN to classify sequences of human cDNA, achieving accuracy of 94%. The author utilized two modules: consensus-ANN (analyses the immediate neighborhood of the TIS candidate) and coding-ANN (evaluates the upstream and downstream regions of the candidate). The consensus-ANN module evaluates the TIS candidate and its most immediate neighborhood through a window of 12 nucleotides. The sequences were extracted from positions -7 to +5 and the binary codification of 4 bits was used. The coding-ANN module evaluates the upstream and downstream regions of the TIS candidate and operates with windows of 54 nucleotides. The final method is the integration of the modules where scores are calculated for each ATG of the molecule and the first ATG which offers a score above 0.2 is considered the TIS of the molecule.

Using SVM, Zien et. al [10] achieved accuracy of 88.1% for the same database as Pedersen and Nielsen [9]. The authors also used the same size of window (203 nucleotides) and the same codification. They showed how to obtain improvements using a new kernel function called locality-improved kernel with a small window in each position. The locality-improved kernel emphasizes correlations between the positions in the sequence that are close to each other and a size of 3 nucleotides upstream and downstream is empirically determined as optimum. In other words, the modification was to favor local correlations between nucleotides while dependencies between nucleotides in distant positions were considered of little importance or nonexistent. With this kernel function, the authors obtained sensitivity, specificity and accuracy of 69.9%, 94.1% and 88.1%, respectively.

At a later date, Zien et. al [10] improved these results through a more sophisticated kernel function known as the Salzberg kernel. The Salzberg kernel is essentially a conditional probabilistic model of the positions of dinucleotides. Using this kernel, the authors obtained an accuracy of 88.6% for the same database. Li et. al [11] utilized two new proposals for the identification of the TIS. Firstly, they introduced a class of new kernels based on string edit distance, called edit kernels, to be used with SVM. According to the authors, the edit kernels are simple and have significant and probabilistic biological interpretations. Next, they converted the downstream region of an ATG into a sequence of amino acids before applying SVM. They demonstrated that the approach they adopted is significantly better (sensitivity = 99.92%, specificity = 99.82% and accuracy = 99.9% for the database used by Pedersen and Nielsen [9]).

Nobre, Ortega and Braga [2] conducted experiments to discover the TIS using 12 nucleotides in the upstream and downstream regions, in addition to SVM with simple kernel functions. Inspired by a study conducted on the frequency of triplets of positive and negative sequences, they presented a new codification methodology. Instead of individually codifying each nucleotide, the codification was done per triplet, with a sliding window of size 3. The authors obtained a 50% reduction in the number of entries. In order to balance the data, they used the Smote algorithm [13] to replicate minority class samples. The authors worked with bases of five organisms extracted from the RefSeq database [14]: Danio rerio, Drosophila melanogaster, Homo sapiens, Mus musculus and Rattus norvegicus, under six levels of inspection. Tzanis et. al [15] developed a methodology for the prediction of the TIS, called MANTIS, with three main components: Consensus, Coding Region classification, and ATG Location. The Coding Region Classification component involves training a model to classify whether or not the ATG of a sequence is the TIS. They utilized features selected from previous studies [1, 4] and PGA (Principal Component Analysis) to obtain the lowest number of non-correlated features, since many are correlated to each other. The Consensus component uses Markov rules which capture not only the probability of occurrence of a nucleotide in a determined position, but also how the occurrence of a base interferes with the occurrence of another in the region close to the ATG (between positions -7 and +5). The ATG location component is considered a new model, being based on the location of the ATG in the sequence in accordance with the Ribosome Scanning Model (RSM) described by Kozak [5, 16]. The final stage of MANTIS is the fusion of the decision of the components, the output being the estimated probability of an ATG being a TIS instead of a simple true/false decision. For the prediction, four classification algorithms were used: Naive Bayes, C4.5, K-nearest neighbor and SVM, obtaining an average accuracy and adjusted accuracy of 98.03% and 94.28%, respectively.

Tikole and Sankararamakrishnan [17] used ANN with two hidden layers to predict the TIS in sequences of human mRNA in which there is a week Kozak context. The authors stated that the translation initiation site has a weak Kozak context if purine and guanine are absent in positions -3 and +4, respectively. They obtained sensitivity of 83% and specificity of 73%.

In contrast to other authors, Zeng et. al [18] created an algorithm with the aim of constructing representative, dependable and readily available databases free from redundancy in order to facilitate the evaluation of the efficiency of the algorithms used for predicting the TIS. To prepare these databases, they considered three different features: the molecular weight (MW), the isoelectric point (IP) and the hydrophobicity index (HI) profile.

Saeys, Abeel, Degroeve and Peer [19] evaluated the performance of several TIS recognition methods at the genomic level, and compared them to state-of-the-art models for TIS prediction in transcript data. The authors concluded that the simple methods largely outperform the complex ones at the genomic scale, and proposed a new model for TIS recognition at the genome level that combines the strengths of these simple models.

Sparks and Brendel [20] demonstrated that improvements in statistically-based models for TIS prediction can be achieved by taking the class of each potential start-methionine into account, pending certain testing conditions. They developed the MetWAMer package for TIS prediction and demonstrated that the proposed model based on perceptron is suitable for the TIS identification task.

Having identified that the problem of predicting the TIS is highly imbalanced and that the oversampling methods, which have already been used in the present context, significantly increase computational complexity, this study proposes an undersampling class balancing method, M-Clus. This is particularly important for large databases where oversampling techniques are not viable as they significantly increase the size of the databases involved.

In addition to the balancing method, this study also investigates the integration of features into positive and negative sequences, attempting to increase the measures of performance.

Finally, a methodology for the inclusion of acquired knowledge (InAKnow) by the classifier is proposed, where, from the model obtained by training using upstream region sequences and the TIS, the sequences of the downstream region are first classified and later included in new training. This methodology increases the rate of precision of all the evaluated databases.

This paper is organized as follows: Firstly, the “Methods” Section shows all the steps used in this study for the prediction of TIS. To test the proposed methodology the organisms Mus musculus and Rattus norvegicus have been used as a reference. The “Results and Discussion” Section presents the results obtained by the proposed methodology for these two organisms. Once defined, the best configuration was tested with larger databases such as Arabidopsis thaliana, Caenorhabditis elegans, Drosophila melanogaster and Homo sapiens. This is detailed in the “Validation of the methodology with other databases” Section. The “Comparison with other TIS prediction tools” Section provides a comparison between some existing tools for predicting TIS and the methodology proposed in this study. Finally, the “Conclusions” Section presents the final considerations.

Methods

This section describes the methodology used to develop the proposed TIS prediction model, namely: description of the database used, the form of extraction of the positive and negative sequences from the mRNA, balancing methods, the classifier used, the inclusion of features, incorporation of the knowledge acquired by the classifier, the measures of performance and the validation process used.

Database

Since the proposed method requires a large amount of testing (multiple window sizes, features, etc.), it was initially tested with the smaller databases, Mus musculus and Rattus Norvegicus, and then expanded to organisms which have a larger amount of mRNA: Arabidopsis thaliana, Caenorhabditis elegans, Drosophila melanogaster and Homo sapiens. All databases were extracted from the public database RefSeq [14] and relate to the organisms under the reviewed inspection level already evaluated by Nobre, Ortega and Braga [2].

Extraction of the positive and negative sequences

In order to use the SVM classifier, positive (TIS) and negative (non-TIS) sequences were extracted through an implemented tool, PredictTIS [21], with variations of windows of the following sizes: -8+8 (8 nucleotides in the upstream and downstream regions, respectively), -12+12, -20+20, -30+30, -40+40, -50+50, -60+60, -10+50, -50+10, -10+30, -10+20, -8+30, -12+20 e -12+30. Initially, experimental tests were conducted with windows of symmetrical size, for example -12+12. However, tests with asymmetrical windows proved to be more efficient. The executable file PredictTIS is available for download from [21].

The sequences were extracted only from files containing the minimum number of nucleotides in the upstream region of the window. Thus, all the files that did not contain this number were disregarded. Having extracted fragments of negative sequences from the database, there were two possible classifications in accordance with the alignment of the ATG with the TIS: in frame or out of frame. If a sequence is in frame with the TIS, this means that it is aligned with the TIS. In other words, the start of the ATG is a position which is a multiple of 3 of the upstream and downstream regions with regard to the TIS. Figure 1 presents examples of extraction of positive and negative sequences given a molecule of mRNA. The TIS is determined by ATG, highlighted in red, and is represented by positions +1, +2 and +3. Figure 1 (a) presents an example of a positive sequence. Parts (b) and (c) of Figure 1 present examples of out of frame and in frame negative sequences, respectively.

Figure 1
figure 1

Extraction of sequences and ribosome scanning model (RSM). The ribosome scans the mRNA sequence from 5’ to 3’ until it reads an ATG codon with an appropriate context. If the AUG codon has an appropriate context, the translation initiates at that site and terminates when a stop codon is read. An in-frame codon is represented by three consecutive nucleotides that are grouped together. Part (a) of the figure presents an example of extraction of positive sequences (TIS) and parts (b) and (c) present out of frame and in frame negative sequences, respectively.

In this study, two approaches for the extraction of positive and negative sequences were considered. In the first, all sequences that had ATG and were not the TIS were considered negative. The second approach, called I nclusion of A cquired Know ledge (InAKnow), considered that all ATGs that are in the downstream region had no classification, at first. This is considered since these ATGs are not evaluated by the Ribosome Scanning Model (RSM).

Table 1 presents the total number of mRNA molecules for the organisms (Mus musculus and Rattus norvegicus) in addition to the number of positive sequences (POS) and the out of frame negative sequences in upstream and downstream regions for the two approaches used (with or without InAKnow). A window size of -10+30 was used since this was the window that gave the best results.

Table 1 Number of positive, out of frame upstream and downstream negative sequences (OFN) with a window size of -10+30. Compares the two approaches: with and without the inclusion of the acquired knowledge method (InAKnow).

From this table, it should be observed that the problem is highly imbalanced, justifying investment in balancing methods. It should also be noted that the number of positive sequences extracted is not equal to the number of mRNA molecules, since only those sequences that had CDS greater than or equal to 10 nucleotides (the size of the upstream region) were extracted (94.5% and 8.66% for Mus musculus and Rattus norvegicus, respectively). Additionally, some molecules were discarded as they did not start with the ATG codon (7.44% for Mus musculus and 0.99% for Rattus norvegicus). The problem of class imbalance applied to all other window sizes analyzed.

In accordance with the main authors in the literature, the sequences were codified using the 4 bits codification scheme mentioned in the review of the current state of research.

Class balancing

In the field of classification, a database is described as imbalanced when there are much fewer cases of some classes than others [22]. This type of problem is of great importance since datasets with this characteristic can be found in many areas. Many learning systems assume that classes are balanced and, as a result, these systems fail to produce a classifier that is capable of accurately predicting the minority class in the presence of data containing imbalanced classes [23]. Very frequently, the classifiers tend to value predominant classes (cases) and ignore the least frequent classes [24].

The problem of predicting the TIS is inherently imbalanced since a molecule of mRNA has only one ATG that codifies protein, while all the others are non-TIS. For the organisms Mus musculus and Rattus norvegicus, for example, there is an average disproportion of 1:23 and 1:131, respectively. This disproportion is 1:24, 1:51, 1:22, 1:22 and 1:10 for Arabidopsis thaliana, Caenorhabditis elegans, Drosophila melanogaster, Homo sapiens and Nasonia vitripennis, respectively.

It is worth noting that the problem would be even greater if evaluation of TIS was performed at the DNA level since the imbalance in this case would be far greater than at the mRNA level.

The sampling methods for class balancing aim to alter the distribution of the training data in order to increase the accuracy of its models [24]. This is achieved by eliminating cases of the majority class (undersampling) or replicating cases of the minority class (oversampling). In the literature, these are known as random undersampling and oversampling methods that do not use heuristics in the elimination/replication of cases and those that do [13, 2325].

According to Batista et. al [23], various authors agree that sampling methods that do not use heuristics can cause unwanted disturbances in the models generated. The simple replication of minority class cases can cause overfitting, while the random elimination of majority class cases can remove important information for the learning process.

In this study, the following balancing methods were used:

Random undersampling This method randomly eliminates majority class cases with the aim of matching the quantity of minority class cases. It is used in this study to evaluate and validate the other methods used and proposed.

SBC ( Sampling Based on Clustering ) A method of undersampling proposed by Yen and Lee [25] where the main idea is that there are different clusters in the database with different features. The complete database, composed of the minority and majority classes, is grouped into k clusters. From these clusters, samples of the majority class are selected according to the proportion of samples of this class (SizeMA) and the minority class (SizeMI) in each cluster i. The number of samples of the majority class selected in cluster i, represented by , is calculated by Equation 1..

(1)

where m × Size MI is the total majority class samples selected that should be in the final training file and m indicates the proportion between the majority and minority classes; in this case 1:1. is the total number of majority class samples to the number of minority class samples in all clusters. Thus, Equation 1 determines that more majority class samples would be selected in the cluster which behaves more like the majority class samples. In this study, the k-means clustering method was used with 4 clusters, a quantity already evaluated by Yen and Lee [25].

M- Clus ( Majority class undersampling based on Clustering ) The main characteristic of the method proposed in this study is the creation of a clustering with the sequences of the majority class. From this clustering, the most significant characteristics of each cluster are selected for the training stage. Clustering is an unsupervised classification of patterns (observations, items of data or vectors of characteristics) in groups. Intuitively, each group is composed of patterns that are similar to each other and dissimilar to the patterns of other groups [26].

In order to create the clustering, the k-means algorithm proposed by Macqueen [27] was used, and applied to situations in which all of the variables are quantitative and the dissimilarities between them can be measured in a Euclidean distance [28].

The algorithm begins with the choice of the k elements that form the initial seeds. This choice can be made, among other methods, by selecting the first k observations, in a completely random manner or even in such a way that its values are very different.

Once the initial seeds are chosen, the distance of each element in relation to the seeds is calculated. The element is placed in the group that has the least distance (most similar) and the centroid is recalculated. The process is repeated until all of the elements are part of one of the clusters. After grouping all of the elements, an attempt is made to find a partition better than one generated arbitrarily. To this end, the degree of internal homogeneity of the groups is calculated using the Residual Sum of Squares (RSq) which is the measure used to evaluate the quality of a partition. After the calculation, the first object is moved to the other groups and verified for an increase or decrease in the value of the RSq. If there is a change, the object is moved to the group that generated the largest increase. The RSq of the groups is then recalculated and the process moves to the next object. After a certain number of iterations or when there are no further changes, the process is interrupted [27].

For the purpose of balancing, the quantity of clusters k varied between the total (k Size MI ), half (k Size MI /2) and one third (k Size MI /3) of the number of minority class sequences; and for each cluster, one, two and three sequences are removed, respectively. In order to select the sequences, those with the smallest distance to the centroid of the cluster are removed.

Inclusion of features

In this study, in addition to its own sequence, some features reported in previous studies were included. Thus, by generating the training and test sets, a combination was formed between the extracted sequences and the selected features: presence or absence of an ATG upstream in frame with the TIS, presence or absence of a stop codon in the following 100 nucleotides [1, 4, 15, 29, 30], presence or absence of the codons CTG, GAC, GAG and GCC in the downstream region in frame with the TIS [4, 15, 29].

An ATG upstream in frame can be explained by the ribosome scanning model, which scans from region 5’ to region 3’ until it finds the first ATG which contains a translation context. Thus, an ATG closer to region 5’ has a high probability of being the TIS. Consequently, the presence of an ATG in the upstream region in frame with the TIS could indicate that the initially predicted TIS has less chance of being the actual TIS. This fact was also reported by Rogozin et. al [31] who demonstrated that a negative correlation exists between the quality of the context of the initiation of translation and the number of ATGs in the upstream region. This characteristic proved to be of great relevance to this study since the best results were obtained when this characteristic was included and combined with others.

The presence or absence of stop codons (TAA, TAG and TGA) in frame in the downstream region in the following 100 nucleotides is explained by the biological process of translating the in frame codons into amino acids. The translation process ends when a stop codon in frame is found. Therefore, the presence of any in frame stop codon in the following 100 nucleotides indicates that the protein should not have more than 33 amino acids. This is less than the majority of existing proteins, indicating that the ATG may not be the TIS [2].

Some features presented in previous studies, such as positions -3 and +4 and the size of the upstream and downstream regions, were not considered as they are implicit in the extracted sequences.

Support vector machines

Support Vector Machines (SVM) is a machine learning technique founded on the inductive principles of Structural Risk Minimization. These principles originate from Statistical Learning Theory [32]. Characterized as a machine learning algorithm capable of resolving linear and nonlinear classification problems, the main idea of classification by support vector is to separate examples with a linear decision surface and to maximize the margin of separation between the other training points [2].

The SVM works as follows: Given a set of training data x i , , each with an input vector x i n and corresponding binary output y i [–1, +1], the objective is to separate the class -1 vectors from the class +1 vectors.

The SVM-light version implemented by T. Joachims [33], available at http://svmlight.joachims.org, was used here. A 4th order polynomial function was adopted and the trade-off between training error and margin was 1.0, defined by testing tirelessly (not shown).

Inclusion of acquired knowledge

As shown in Figure 1, the scanning model supposes that the ribosome is first connected to region 5’ of the mRNA and travels in the direction of region 3’ until it finds the first ATG of the sequence [5]. However, there are exceptions: as a result of poor context (for example, noise), the first ATG could be ignored. Considering this ribosome scanning model, it can be observed that only the ATGs in the upstream region of the TIS and the TIS itself have classification. Thus, all other ATGs that are in the downstream region, a priori, has no definite classification. That is, there may be an appropriate context for ATG with TIS in the region downstream, and this is not only because the ribosome have already started the translation into an ATG before. Figure 1 presents this model: the ribosome, not identifying the first ATG(s) of the sequence as the TIS, moves to the second, third or more ATGs, classifying them as non-TIS until it finds the ATG that it classifies as TIS. In this sense, there is no exact classification for any of the ATGs in the downstream region of the TIS [2].

Taking this into account, this study presents a methodology that uses the model created from the negative sequences of the upstream region and the positive sequences (TIS) to classify the negative sequences in the downstream region. Based on the classification obtained by this model, these sequences are classified and a new model is trained, thus obtaining the final model. In this new model, the number of positive sequences may increase since the system can identify a candidate TIS in the downstream region. This process of including acquired knowledge (InAKnow) is shown in Figure 2.

Figure 2
figure 2

Methodology of inclusion of acquired knowledge (InAKnow). According to the ribosome scanning model, the sequences extracted from the downstream region of the TIS do not have classification. Thus, at Level 1 of this proposed methodology, the sequences of the upstream region (positive and negative) are trained by the classifier, and at Level 2 the model created by this training is applied to the sequences of the downstream region (without classification). Subsequently, the sequences of the downstream region (now classified), together with those of the upstream region are again inserted into new training, thereby generating a new model (Level 3).

In accordance with this methodology, the following steps are followed:

1. Obtain a model, considering only the positive sequences (TIS) and the out of frame (OFN) negative sequences (non-TIS) contained in the upstream region (Figure 2 - Level 1);

2. Classify the ATGs in the downstream region using the model generated in the previous step (Figure 2 - Level 2);

3. New training with all of the sequences, including those classified by the previous step (Figure 2 -Level 3). In this stage, there is a decrease in the class imbalance due to the inclusion of sequences classified as positive by the model. Thus, the proportion of 1:23 was reduced, approximately, to 1:1 (Mus musculus) and 1:3 (Rattus norvegicus). The disproportion was reduced to 1:8, 1:7, 1:5, 1:5 and 1:1 for Arabidopsis thaliana, Caenorhabditis elegans, Drosophila melanogaster, Homo sapiens and Nasonia vitripennis, respectively.

Measures of performance

Five measures were used to evaluate the performance of the classifier: accuracy (Ac), precision (Pr), sensitivity (Se), specificity (Sp) and adjusted accuracy (Acj) [2, 4, 10, 15, 29].

Accuracy measures the proportion of correct predictions, as described in Equation 2.

(2)

where TP, TN, FP and FN denote the number of true positives, true negatives, false positives and false negatives, respectively.

Precision measures the proportion of possible TIS that are definitely TIS (Equation 3).

(3)

Sensitivity, also known as the true-positive rate, refers to the percentage of correct items within the positive class. In other words, it measures the proportion of TIS that were correctly classified as TIS (Equation 4).

(4)

Specificity, also known as the true-negative rate, refers to the percentage of correct items within the negative class. In other words, it measures the proportion of non-TIS that was correctly classified as non-TIS (Equation 5).

(5)

Adjusted accuracy is the average of the sensitivity and specificity measures (Equation 6).

(6)

All results presented in the “Results and Discussion” Section are based on these measures using the concept of cross validation. In addition to these performance measures, an alternative method for assessing the performance of these classifiers is the analysis of ROC curves [34]. An ROC graph can be used to analyze the relationship between false negatives (FN) and false positives (FP) or true negatives (TN) and true positives (TP) for a given classifier.

Validation

10-fold cross validation was used, identified by Kohavi [35] as the most efficient form of evaluation for selecting models. The process of cross validation used in this study followed the methodology suggested by Machado [24], where the imbalanced database is initially divided into ten subsets. Nine subsets are reserved for training while only one is destined for testing. The training set is then balanced by the application of the balancing methods described above. This data is used in the SVM during training and tested with the reserved subset. This process is repeated ten times and after the final repetition, the average performance and standard deviation are calculated.

Results and discussion

Evaluation of the window size

Considering the databases of Mus musculus and Rattus norvegicus, extensive experiments were conducted with the aim of evaluating the size of window which offers the best performance. Tables 2 and 3 shows the results os this tests. The numbers between brackets are the corresponding standard deviations. Observing these tables, it can be observed that as the size of window increases there is an increase in the accuracy and specificity rates. On the other hand, there is a fall in sensitivity (this is an important measure). Increasing the window size in the upstream and downstream region at the same time causes the sensitivity and specificity rates to counter each other. In other words, when one increases, the other decreases, as shown in Figure 3 (a) and (b).

Table 2 Comparison of performance as a function of window size for the Mus musculus organism.
Table 3 Comparison of performance as a function of window size for the Rattus novergicus organism.
Figure 3
figure 3

Graph of window size - symmetrical. Presents the results, particularly the rates of sensitivity and specificity, for various symmetrical window sizes. These results were obtained using the M-Clus balancing method and the features ATG + STOP + GAG. The inclusion of acquired knowledge, InAKnow, was not used. Parts (a) and (b) of the figure present results for Mus musculus and Rattus norvegicus, respectively.

In an attempt to avoid this effect and improve the performance of the classifier, windows of asymmetrical sizes were exploited. From Figure 4 (a) and (b), it can be observed that increasing the size of the downstream regions results in an increase in specificity and a decrease in sensitivity; consequently, the size of this region should not be very large so as not to interfere with the rate of sensitivity but should not be too small to guarantee a good rate of specificity.

Figure 4
figure 4

Graph of window size - downstream region. Presents the results, particularly the rates of sensitivity and specificity, for various asymmetrical window sizes where the downstream region is varied. These results were obtained using the M-Clus balancing method and the features ATG + STOP + GAG. The inclusion of acquired knowledge, InAKnow, was not used. Parts (a) and (b) of the figure present results for Mus musculus and Rattus norvegicus, respectively.

On the other hand, when there is an increase in the upstream region, there is a significant decrease in sensitivity (Figure 5 (a) and (b)). Thus, there is evidence that sensitivity is related to the nucleotides in positions close to the TIS. In other words, the context in which the ribosome initiates translation in a given ATG are the nucleotides before and after the ATG that is being validated. This corroborates the study of Hatzigeorgiou [6] which used the ANN Consensus Model with a window size of 12 nucleotides, from -7 to +5, and verified that this model was sensitive to the stable region of the TIS. Tzanis et. al [15] also used a component which analyzed the region around the TIS, from -7 to +5, using Markov chains to capture the consensus pattern, indicating that for the identification of the TIS it is important to examine a restricted area around it.

Figure 5
figure 5

Graph of window size - upstream region. Presents the results, particularly the rates of sensitivity and specificity, for various asymmetrical window sizes where the upstream region is varied. These results were obtained using the M-Clus balancing method and the features ATG + STOP + GAG. The inclusion of acquired knowledge, InAKnow, was not used. Parts (a) and (b) of the figure present results for Mus musculus and Rattus norvegicus, respectively.

Among the tests conducted, the window size of -10+30 generated the best results, improving the adjusted accuracy, represented by the average of the sensitivity and specificity.

Evaluation of the features included

From Tables 4 and 5, it can be observed that the inclusion of features improves the performance of the classifier. A comparison of the tests with no features with those which included ATG + STOP + GAG, reveals an increase of approximately 9.42% and 6% in the rate of sensitivity observed for Mus musculus and Rattus norvegicus, respectively. Moreover, the rate of specificity did not vary much at approximately 1.11% and 0.72% for Mus musculus and Rattus norvegicus, respectively.

Table 4 Comparison of performance as a function of the inclusion of features for the Mus musculus organism.
Table 5 Comparison of performance as a function of the inclusion of features for the Rattus novergicus organism.

Theses results were generated using the balancing method proposed in this study, M-Clus, and a window size of -10+30. These tests were also applied to other sizes of window, -50+50, -12+12 and -10+20, and this behavior was observed in all situations. Thus, the inclusion of features is relevant for increasing the sensitivity of the classifier.

However, there are features which, when added to the sequences, slightly decreased the performance of the classifier (from 0.19% to 1.92% for Mus musculus and from 0.91% to 3.91%, for Rattus novergicus). For example, for Mus musculus, adding the features CTG or GAG or GAG or CTG + GAG or GAC + GCC, causes a decrease of approximately 1.9% in the rate of sensitivity. For Rattus novergicus, adding the features CTG + GAC + GAC + GCC or STOP + GCC causes a decrease of approximately 3% in the rate of sensitivity. However, this variation is too small to be considered a decrease in the performance of the classifier.

Interestingly, the characteristics which gave the best performance by the classifier for the organism Mus musculus also gave the best performance when applied to the Rattus norvegicus organism. Table 6 presents the sixteen most important features, noting the sensitivity for the two organisms analyzed.

Table 6 The sixteen most important features for each organism.

The following are the main features that were highlighted: ATG + STOP + GAG, ATG + STOP + CTG + GAC + GAG, ATG + STOP, ATG + STOP + CTG + GAC. In addition to this, the ATG upstream in frame characteristic is highly relevant since the best results were obtained by the combination of this with other features. It is worth emphasizing that there is a significant increase in sensitivity of 7.21% and 4% for Mus musculus and Rattus norvegicus, respectively, when only the ATG upstream characteristic is considered.

Thus, the tests conducted demonstrate that the classifier achieves good performance levels when it considers only the positive and negative sequences (linear sequence of bases). However, it also demonstrates that it is possible to increase performance by including features deemed relevant for the context considered.

Evaluation of the balancing methods

Figure 6 presents the results of the M-Clus balancing method, with variation in the number of clusters. It should be observed that when the number of clusters is decreased, the rates of specificity and precision decrease. This can be understood by the low representativeness of the negative class (majority), since when the quantity of clusters is decreased by half, two sequences are extracted per cluster. Thus, the sequences extracted are those closest to the centroid and, consequently, are close to each other. Therefore, there is no good representativeness for all negative sequences. Thus, to obtain greater representativeness of the majority class, the quantity of clusters was considered equal to the quantity of elements of the minority class (SizeMI).

Figure 6
figure 6

Graph of the M-Clus balancing method. Presents the results of the M-Clus method where the quantity of clusters created (k) is varied. These results were obtained using window size of -10+30 and the features ATG + STOP + GAG. The inclusion of acquired knowledge, InAKnow, was not used.

A comparison of the results obtained by the other balancing methods analyzed, presented in Table 7, shows that when no balancing method is used the rate of sensitivity is very low at 51.39% for Mus musculus and 47.45% for Rattus novergicus. This occurs because the database is imbalanced and the classifier therefore learns a lot about the negative class (majority) and little about the positive class (minority). Thus, the system tends to find a large number of false negatives, and, through Equation 4, it can be observed that the sensitivity decreases with an increase in FN (false negatives).

Table 7 Comparison of performance as a function of the balancing method.

This fact supports the authors Machado [24] when they state that the classifiers generated from imbalanced databases present high levels of false negatives for rare classes which is problematic when these are the classes being studied.

The use of any of the balancing methods analyzed increases sensitivity by around 40% for both Mus musculus and Rattus norvegicus. The method of balancing proposed, M-Clus, performed better than all other methods, especially with regard to the rate of adjusted accuracy. For the organism Mus musculus, the best performance compared to the rate sensitivity refers to the method M-Clus. As for the Rattus norvegicus best value for the rate sensitivity is given to using the SBC method, but there is a drop in rates of accuracy and specificity and hence in the adjusted accuracy. The random undersampling method is slightly better than the SBC method, its use being of interest because it is a simple method to implement. An analysis of the rate of precision reveals that the performance is 98.5% and 96.9% without the use of any balancing techniques. This rate is significantly reduced when a method is used to conduct the balancing. This can be explained by the fact that when no balancing method is used, the classifier learns little about the positive class. Consequently, few samples from the test set are classified as positive and few false positives are therefore generated. As the rate of precision evaluates how many possible TIS (classified as TIS) are actually TIS, this rate is of great value since few examples are classified as TIS and, consequently, few are false positives. In other words, as the precision is given by Pr = TP/(TP+FP), the rate increases with the reduction of FP (false positives).

Finally, it is important to emphasize the necessity of presenting all measures of performance since it is possible to have a system with a very high level of accuracy but which presents practically no knowledge with respect to the class of interest.

With the objective of improving the level of precision, a new methodology, described in the background section, was planned, namely the method of including acquired knowledge. The results are presented below.

Evaluation of the method of including acquired knowledge

The use of the methodology of including acquired knowledge (InAKnow), described in the background section, increased all the rates evaluated, especially the rate of precision which increased by 39% (Table 8) for Mus musculus. The rates of sensitivity, specificity and adjusted accuracy increased by 1.68%, 1.33% and 1.51%, respectively. For Rattus norvegicus, the increase was 22.0%. However, the accuracy value was still low. This can be explained by the small amount of positive sequences (only 101) due to the fact that 91% of mRNA molecules were disregarded by initiating translation at positions prior to 10 nucleotides (window size of the upstream region).

Table 8 Comparison of performance with and without the inclusion of the acquired knowledge method (InAKnow).

When analyzing the results of experiments for the organism Rattus norvegicus, a significant improvement in the rate of sensitivity (8.15%) was observed when using the InAKnow methodology, meaning that the classifier learned better from positive sequences. As for the rates of accuracy and specificity, there was a slight drop of 0.31% and 0.38%, respectively.

The significant improvement in the rate of precision is due to the reduction in the number of samples classified as false positive. This reduction occurs in accordance with the ribosome scanning model [5] which does not evaluate the ATGs in the downstream region of the TIS where there may be sequences of ATG with the appropriate context to be the TIS.

Using the proposed methodology, the sequences of the downstream region of the TIS are initially classified via a previously generated model, using only the known TIS sequences and the negatives from the upstream region and those which are out of frame. Only after this initial classification will these sequences form part of the final training and test sets.

The sequences that were in the downstream region but which possess the necessary features to be the TIS will form part of the positive sequence set since, as per the ribosome model, these sequences can become the TIS if no ATG with the appropriate context has been found. Using this methodology, 14% of the sequences that were in the downstream region were classified as positive for Mus musculus and 2.15% for Rattus novergicus. These rates were 7.5%, 10.9%, 13.1%, 13.1% and 47.62% for Arabidopsis thaliana, Caenorhabditis elegans, Drosophila melanogaster, Homo sapiens and Nasonia vitripennis, respectively. This methodology, therefore, is of fundamental importance for obtaining a classifier with a high rate of precision and demonstrates how the knowledge acquired by the classifier is relevant for classifying sequences with an unknown classification a priori.

Figure 7 show the ROC curve, plotted in R [36], for Mus musculus and Rattus norvegicus, with and without the inclusion of the acquired knowledge methodology (InAKnow).

Figure 7
figure 7

ROC curve for Mus musculus and Rattus norvegicus. Presents the ROC curve for Mus musculus and Rattus norvegicus, without and with the inclusion of the acquired knowledge methodology (InAKnow).

Validation of the methodology with other databases

Once the methodology was fully tested for Mus musculus and Rattus norvegicus and the best settings for each of the tests was identified (window size, added features, balancing method and inclusion of knowledge), larger databases were also evaluated.

Thus, based on the best configuration obtained, the databases of the organisms Aradidopsis thaliana, Caenorhabditis elegans, Drosophila melanogaster, Homo sapiens and Nasonia vitripennis, which were extracted from the RefSeq database, were also validated. The number of positive, out of frame negative sequences in upstream and downstream regions are presented in Table 9, with and without the inclusion of the acquired knowledge Methodology (InAKnow).

Table 9 Number of positive, out of frame upstream and downstream negative sequences (OFN) with a window size of -10+30. Compares the two approaches: with and without the inclusion of the acquired knowledge method (InAKnow).

Table 10 presents the results obtained with and without the inclusion of knowledge, using the random undersampling method.

Table 10 Comparison of performance without and with the inclusion of the acquired knowledge methodology (InAKnow).

Although the M-Clus method offered a slightly better performance than the random method for Mus musculus and Rattus norvegicus, it requires greater computational time than other methods for clustering all sequences in the training file. Since the clustering was performed using the k-means algorithm with the Euclidean distance function, the distances of all sequences from possible initial centroids were calculated. K corresponds to the number of sequences from the minority class. Each time the centroids were modified, the distances of all sequences to the new centroids were also recalculated, searching k clusters with greater similarity between the sequences of the group and higher dessimilaridade between groups. This greatly increases the processing time for large databases.

Thus, as there is a significant delay in executing the M-Clus algorithm, and since, according to the results already presented, its performance is similar to the random method, we used the random undersampling method in conjunction with the knowledge inclusion method (InAKnow), which produced good results. In Table 10, it can be observed that the rates increased with the use of InAKnow, especially the precision which increased by 37.2%, 70.19%, 37.17%, 30.82% and 5% for Aradidopsis thaliana, Caenorhabditis elegans, Drosophila melanogaster, Homo sapiens and Nasonia vitripennis, respectively. That is, with InAknow, the model better learns the true positives since it demonstrates a higher rate of correctly identifying those which are truly positive.

This is probably due to the fact that the InAKnow method improves the knowledge of the model by recovering more positive sequences, thus yielding an increase in precision. These sequences are extracted from the downstream region and are assumed as negatives a priori.

However, sensitivity decreased most for Homo sapiens (18.96%), for interval confidence between 56.17% and 89.75 for a confidence level of 95%. Analyzing the results of each fold, we find that folds 1, 6 and 5 are the ones responsible for this decrease, as per Table 11. Further studies will be carried out to analyze these sequences added by InAKnow.

Table 11 Sensitivity, by fold (F), of the classifier using the methodology InAKnow.

In general, the low sensibility can be attributed to two causes. Firstly, the model polarized the acquisition of knowledge because it adjusted to a larger number of negative than positive sequences. In the present approach, this situation does not occur due to the fact that the training set was balanced. Secondly, the training set contains false negative sequences. In both cases, parameter FN from equation 4 tends to increase, diminishing the value of sensitivity.

From examination of the Mus musculus and Rattus norvegicus databases, analyzed in Table 1, it is clear that they contain less positive sequences than negative sequences (upstream region). Thus, it is beneficial to increase the number of positive sequences through the InAKnow method. This increased the precision. Conversely, in Table 9, it is observed that there are some databases where the number of true positive sequences is larger than the number of true negative sequences (upstream region). Since the InAKnow method adds new sequences that have been identified as positives, which are extracted from the downstream region, the difference between the two types of sequences increases.

In this situation, which is less common (more positive than negative sequences), the present approach performs the balancing. That is, it increases the number of negative sequences using downstream sequences. It is important to note that it is not assumed that sequences in this region are all negatives. This can lead the model to increase the value of the false negative (FN) parameter and consequently decrease sensitivity. Taking this into account, the search for knowledge associated with the sequences that are not TIS seems important. We believe that the proposed InAKnow method can evolve, incorporating new knowledge that confirms that the downstream sequences are truly negatives. From this perspective, it would be possible to create acquired knowledge inclusion models that are more robust.

Comparison with other TIS prediction tools

The methodology used in this study is compared with the First-ATG [5], NetStart [9] (available at http://www.cbs.dtu.dk/services/NetStart/), TIS Miner [37] (available at http://dnafsminer.bic.nus.edu.sg/Tis.html), and ATGpr (available at http://flj.hinv.jp/ATGpr/atgpr/index.html) programs.

The First-ATG method, proposed by Kozak (1984), proposes that the TIS of a molecule of mRNA is the first-ATG. For every molecule where TIS genuinely is the first-ATG, a TP (true positive) is added and each molecule where the TIS is not the first-ATG, a FP (false positive) is added.

To interpret the results reported by the Netstart tools, the methodology adopted by Sparks and Brendel [20] was used. Since this method is a TIS classifier and not a TIS prediction system, if the prediction given to the TIS is “Yes” (indicating that it TIS) a true-positive is counted. If it is not, a false negative is recorded. For every negative in the upstream region of the system set, the prediction is counted as a true-negative and false-positive results are not accounted for. The web interface and its Vertebrate-specific parameters were used. For the TIS Miner and ATGpr tools, the same methodology was used with the default settings.

Table 12 presents the results for the Mus musculus and Rattus norvegicus organisms. It can be observed that the methodology used in this study obtained a better performance by observing the sensitivity rate. The performance of the methodology used in this study for the organism Rattus norvegicus can be understood by the fact that for most of the sequences of this organism the TIS starts in the first position of the mRNA. These sequences are not analyzed by the methodology as they do not have 10 nucleotides in the upstream region of TIS (50.39% in total). Thus, many sequences were not analyzed by the methodology since these tests selected 20% of mRNA molecules in a random order.

Table 12 Comparison with other TIS prediction tools.

All raw output generated by these tools on our test data is available as supplementary information at [21].

Conclusions

As demonstrated in this study, the task of predicting the TIS is not a simple problem to resolve. Innumerable methods have been evaluated in the literature and this study presents a new methodology for finding the TIS based on balancing methods, including features and the concept of knowledge inclusion. What the authors aimed to do throughout the development of the study was to present methods which find TIS which are actually TIS. This was also done with a concern for the number of sequences used.

Since this problem is intrinsically imbalanced, undersampling class balancing methods were evaluated and the M-Clus undersampling method was also proposed. Undersampling methods, in contrast to oversampling methods which replicate the number of sequences, have the advantage of working with a much smaller number of sequences which appreciably reduces computational processing. This is particularly important in large databases like that of Homo sapiens, Drosophila melanogaster, Arabidopsis thaliana and Caenorhabditis elegans, analyzed in this study.

Considering the performance measures evaluated, the proposed balancing method proved to be very promising, offering the best results when compared to the random undersampling balancing method, SBC and classification without balancing. With M-Clus, there was an increase of 40.16% in the rate of sensitivity and 17.54% in the rate of adjusted accuracy, indicating that investment in balancing methods is necessary to resolve the problem. However, the precision was reduced by 55.45%, a problem which was resolved by the inclusion of acquired knowledge.

However, the proposed method also has a disadvantage since the number of interactions to get the best clusters demands a very large computational processing time. In larger databases this may be limiting and in this study, due to time constraints, the random balancing method was used to balance the larger databases since this was also efficient for the proposed problem. Two solutions to this problem are being worked on: 1) create heuristics to limit the number of iterations performed to obtain the best clusters, and 2) implement the methodology in a parallel and distributed manner, rather than sequentially.

There was an increase of up to 70.19% in precision when knowledge acquired (InAKnow) by the classifier was included in the new training set. This is due to the reduction in the number of samples classified as false positive in accordance with the ribosome scanning model [5] which does not evaluate the ATGs in the downstream region of the TIS where there may be sequences of ATG with the appropriate context to be the TIS.

The inclusion of certain features with the extracted sequences was also analyzed and it was concluded that, in general, this improves the performance of the classifier. The inclusion of features such as the presence of ATG in the upstream region of the TIS improved the rate of sensitivity by approximately 7.21% for Mus musculus and 4% for Rattus norvegicus.

Finally, according to the tests conducted on window size, there is evidence that sensitivity is related to the nucleotides close to the TIS. In other words, the context for the ribosome to initiate translation in a determined ATG are the nucleotides before and after the ATG that is being validated. The window that generated the best results had 10 nucleotides in the upstream region and 30 in the downstream region (-10+30).

In light of all the arguments presented, it is concluded that the methodology proposed contributes in a significant way to the prediction of the TIS.

References

  1. Tzanis G, Berberidis C, Vlahavas I: A novel data mining approach for the accurate prediction of translation initiation sites. 7th International Symposium on Biological and Medical Data Analysis. 2006, 92-103.

    Chapter  Google Scholar 

  2. Nobre CN, Ortega JM, de Pádua Braga A: High efficiency on prediction of Translation Initiation Site (TIS) of RefSeq sequences. Lecture Notes in Computer Science. 2007, 4643/2: 138-148.

    Article  Google Scholar 

  3. Nakagawa S, Niimura Y, Gojobori T, Tanaka H, ichiro Miura K: Diversity of preferred nucleotide sequences around the translation initiation codon in eukayote genomes. Nucleic Acids Research. 2008, 36 (3): 861-871.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  4. Liu H, Han H, Li J, Wong L: Using amino acid patterns to accurately predict translation initiation sites. In Silico Biol. 2004, 4 (3): 255-269.

    PubMed  CAS  Google Scholar 

  5. Kozak M: Compilation and analysis of sequences upstream from the translational start site in eukaryotic mRNAs. Nucleic Acids Research. 1984, 12: 857-872. 10.1093/nar/12.2.857.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  6. Hatzigeorgiou AG: Translation initiation start prediction in human cDNAs with high accuracy. Bioinformatics. 2002, 18: 343-350. 10.1093/bioinformatics/18.2.343.

    Article  PubMed  CAS  Google Scholar 

  7. Cavener DR, Ray SC: Eukaryotic start and stop translation sites. Nucleic Acids Research. 1991, 19 (12): 3185-3192. 10.1093/nar/19.12.3185.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  8. Stormo GD, Schneider TD, Gold LM: Characterization of translational initiation sites in e. coli. Nucleic Acid Res. 1982, 10 (9): 2971-2996. 10.1093/nar/10.9.2971.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  9. Pedersen AG, Nielsen H: Neural network prediction of translation initiation sites in eukaryotes: perspectives for EST and genome analysis. Proc Int Conf Intell Syst Mol Biol. 1997, 5: 226-233.

    PubMed  CAS  Google Scholar 

  10. Zien A, Rätsch G, Mika S, Schölkopf B, Lengauer T, Müller K: Engineering support vector machine kernels that recognize translation initiation sites. Bioinformatics. 2000, 16 (9): 799-807. 10.1093/bioinformatics/16.9.799.

    Article  PubMed  CAS  Google Scholar 

  11. Li H, Jiang T: A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs. RECOMB ’04: Proceedings of the eighth annual international conference on Resaerch in computational molecular biology. 2004, ACM, 262-271.

    Chapter  Google Scholar 

  12. Li G, Leong TY, Zhang L: Translation initiation sites prediction with mixture gaussian models in human cDNA sequences. IEEE Trans, on Knowledge and Data Engineering Knowledge. 2005, 17 (8): 1152-1160.

    Article  Google Scholar 

  13. Chawla NV, Bowyer KW, Hall LO, Kegelmeyer WP: Smote: Synthetic minority over-sampling technique. Journal of Artificial Intelligence and Research. 2002, 16: 321-357.

    Google Scholar 

  14. Pruitt K, Maglott D: Refseq and locuslink: NCBI gene-centered resources. Nucleic Acids Research. 2001, 29: 137-140. 10.1093/nar/29.1.137.

    Article  PubMed  CAS  PubMed Central  Google Scholar 

  15. Tzanis G, Berberidis C, Vlahavas I: MANTIS: a data mining methodology for effective translation initiation site prediction. Conf Proc IEEE Eng Med Biol Soc. 2007, 2007: 6344-6348.

    PubMed  Google Scholar 

  16. Kozak M: Initiation of translation in prokaryotes and eukaryotes. Gene. 1999, 234: 187-208. 10.1016/S0378-1119(99)00210-3.

    Article  PubMed  CAS  Google Scholar 

  17. Tikole S, Sankararamakrishnan R: Prediction of translation initiation sites in human mRNA sequences with AUG start codon in weak Kozak context: A neural network approach. Biochemical and Biophysical Research Communications. 2008, 369 (4): 1166-1168. 10.1016/j.bbrc.2008.03.008.

    Article  PubMed  CAS  Google Scholar 

  18. Zeng J, Alhajj R, Demetrick DJ: Representative transcript sets for evaluating a translational initiation sites predictor. BMC Bioinformatics. 2009, 10: 206-10.1186/1471-2105-10-206.

    Article  PubMed  PubMed Central  Google Scholar 

  19. Saeys Y, Abeel T, Degroeve S, Van de Peer Y: Translation initiation site prediction on a genomic scale: beauty in simplicity. Bioinformatics. 2007, 23: i418-i423. 10.1093/bioinformatics/btm177.

    Article  PubMed  CAS  Google Scholar 

  20. Sparks ME, Brendel V: MetWAMer: eukaryotic translation initiation site prediction. BMC bioinformatics. 2008, 9 (381): 418-423.

    Google Scholar 

  21. PredicTIS. [http://biodados.icb.ufmg.br/predict_tis/]

  22. Chawla NV, Japkowicz N, Kotcz A: Editorial: special issue on learning from imbalanced data sets. SIGKDD Explorations. 2004, 6: 1-6.

    Article  Google Scholar 

  23. Batista G, Prati RC, Monard MC: A study of the behavior of several methods for balancing machine learning training data. SIGKDD Explorations. 2004, 6: 20-29. 10.1145/1007730.1007735.

    Article  Google Scholar 

  24. Machado EL, Ladeira M: Um Estudo de Limpeza em Base de Dados Desbalanceada e com Sobreposição de Classes. XXVII Congresso da Sociedade Brasileira de Computação. 2007, SBC, 330-340.

    Google Scholar 

  25. Yen SJ, Lee YS: Cluster-based under-sampling approaches for imbalanced data distributions. Expert Systems with Applications. 2009, 36 (3): 5718-5727. 10.1016/j.eswa.2008.06.108.

    Article  Google Scholar 

  26. Jain AK, Murty MN, Flynn PJ: Data clustering: a review. ACM Comput. Surv. 1999, 31 (3): 264-323. 10.1145/331499.331504.

    Article  Google Scholar 

  27. Macqueen J: Some methods for classification and analysis of multivariate observations. Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability. 1967, 1: 281-297.

    Google Scholar 

  28. Berkhin P: Survey of Clustering Data Mining Techniques. Tech. rep. 2002, Accrue Software, San Jose, CA

    Google Scholar 

  29. Zeng F, Yap RH, Wong L: Using feature generation and feature selection for accurate prediction of translation initiation sites. Genome Inform. 2002, 13: 192-200.

    PubMed  CAS  Google Scholar 

  30. Li GL, Leong TY: Feature selection for the prediction of translation initiation sites. Genomics Proteomics Bioinformatics. 2005, 3 (2): 73-83.

    PubMed  CAS  Google Scholar 

  31. Rogozin IB, Kochetov AV, Kondrashov FA, Koonin EV, Milanesi L: Presence of atg triplets in 5’ untranslated regions of eukaryotic cDNAs correlates with a ‘weak’ context of the start codon. Bioinformatics. 2001, 17 (10): 890-900. 10.1093/bioinformatics/17.10.890.

    Article  PubMed  CAS  Google Scholar 

  32. Semolini R: Support Vector Machines, Inferência Transdutiva e o Problema de Classificação. Dissertação de Mestrado, Universidade Estadual de Campinas. 2002

    Google Scholar 

  33. Joachims T: Making Large-Scale SVM Learning Practical. 1999, 169-184. [http://www.cs.cornell.edu/People/tj/publications/joachims_99a.pdf]

    Google Scholar 

  34. Bradley AP: The use of the area under the roc curve in the evaluation of machine learning algorithms. Pattern Recognition. 1997, 6 (30): 1145-1159.

    Article  Google Scholar 

  35. Kohavi R: A study of cross-validation and bootstrap for accuracy estimation and model selection. IJCAΓ95: Proceedings oh 14h International Joint Conference on Artificial Intelligence. 1995, Morgan Kaufmann Publishers Inc, 1137-1143.

    Google Scholar 

  36. R RDCT: A language and environment for statistical computing. 2010, Acesso em: 04 abril 2011, [http://www.R-project.org]

    Google Scholar 

  37. Liu H, Han H, Li J, Wong L: DNAFSMiner: a web-based software toolbox to recognize two types of functional sites in DNA sequences. Bioinformatics. 2005, 21: 671-673. 10.1093/bioinformatics/bth437.

    Article  PubMed  CAS  Google Scholar 

Download references

Acknowledgements

The authors acknowledge the financial support received from the Foundation for Research Support of Minas Gerais State, FAPEMIG, through Project CEX PPMIII 67/09, and the National Council for Scientific and Technological Development, CNPq, Brazil.

This article has been published as part of BMC Genomics Volume 12 Supplement 4, 2011: Proceedings of the 6th International Conference of the Brazilian Association for Bioinformatics and Computational Biology (X-meeting 2010). The full contents of the supplement are available online at http://www.biomedcentral.com/1471-2164/12?issue=S4

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cristiane Neri Nobre.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors' contributions

LS and FC have developed the methods and conducted the tests. CN, LZ and JM have provided the expertise and all three authors have drafted, read and approved the manuscript.

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.

Reprints and permissions

About this article

Cite this article

Silva, L.M., de Souza Teixeira, F.C., Ortega, J.M. et al. Improvement in the prediction of the translation initiation site through balancing methods, inclusion of acquired knowledge and addition of features to sequences of mRNA. BMC Genomics 12 (Suppl 4), S9 (2011). https://doi.org/10.1186/1471-2164-12-S4-S9

Download citation

  • Published:

  • DOI: https://doi.org/10.1186/1471-2164-12-S4-S9

Keywords