Browse Subject Areas

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

  • Loading metrics

RBF-TSS: Identification of Transcription Start Site in Human Using Radial Basis Functions Network and Oligonucleotide Positional Frequencies

  • Rami N. Mahdi,

    Affiliation Department of Computer Engineering and Computer Science, University of Louisville, Louisville, Kentucky, United States of America

  • Eric C. Rouchka

    Affiliation Department of Computer Engineering and Computer Science, University of Louisville, Louisville, Kentucky, United States of America

RBF-TSS: Identification of Transcription Start Site in Human Using Radial Basis Functions Network and Oligonucleotide Positional Frequencies

  • Rami N. Mahdi, 
  • Eric C. Rouchka


Accurate identification of promoter regions and transcription start sites (TSS) in genomic DNA allows for a more complete understanding of the structure of genes and gene regulation within a given genome. Many recently published methods have achieved high identification accuracy of TSS. However, models providing more accurate modeling of promoters and TSS are needed. A novel identification method for identifying transcription start sites that improves the accuracy of TSS recognition for recently published methods is proposed. This method incorporates a metric feature based on oligonucleotide positional frequencies, taking into account the nature of promoters. A radial basis function neural network for identifying transcription start sites (RBF-TSS) is proposed and employed as a classification algorithm. Using non-overlapping chunks (windows) of size 50 and 500 on the human genome, the proposed method achieves an area under the Receiver Operator Characteristic curve (auROC) of 94.75% and 95.08% respectively, providing increased performance over existing TSS prediction methods.


The accurate identification of promoter regions and transcription start sites (TSSs) is an important step for in-silico gene discovery and understanding of the transcription regulation mechanisms. Every eukaryotic gene has a core promoter region in the 5′ untranslated region (UTR) that contains at a minimum a TSS signal. Most eukaryotic genes are transcribed by RNA Polymerase 2 (Pol-II) which binds at the TSS. Promoter regions are found to share common subtle patterns or models known as motifs that act as binding sites where other transcription factors (TFs) attach to facilitate or regulate transcription. For example, up to 80% of human promoters contain an initiator element (Inr) located at the transcription start site with a consensus sequence of YCAYYYYY, where Y represents a pyrimidine base C or T [1]. Roughly 30% of human core promoters are found to contain a TATA box at position of −20 to −30 from the TSS with the consensus TATAAA [1]. The TATA box tends to be surrounded by GC rich sequences. Promoter signals with greater variation are found in the promoter region proximal to the TSS, where motifs such as the CAAT, GC, E, and GATA boxes are located [2]. More details about compositional characterization of known human promoter motifs can be found in [2].

Promoter detection algorithms

A number of algorithms for promoter and TSS recognition are currently available. Each attempts to model promoter pattern(s) using features such as CpG islands and known transcription factor binding sites (TFBS) to distinguish promoters from non-promoters. Some methods such as Autogene [3] and Promoter Scan [4] use position weight matrices (PWM) to signal the presence of a high density of binding sites indicating potential promoters. However, it has been shown that both the location and combination of different binding sites are important for promoter recognition [5], [6]. Eponine [7] improves recognition by associating every PWM with a probability distribution based on its position relative to the TSS. A more recent tool that tries to model the oligonucleotide positional densities is described in [8]. However, this particular design employs a naïve Bayes classifier that assumes every oligonucleotide's positional distribution is independent, and is therefore unable to capture the co-occurrence of a specific combination of binding sites.

In a recent study, Bajic and colleagues conducted a large scale comparison study of eight known TSFs [9]. They demonstrate that a number of these tools perform well, yet leave a lot of room for improving detection accuracy. Among the most successful tools identified were Eponine [7], McPromoter [10], FirstEF [11] and DragonGSF[12].

A more successful approach is the ARTS tool developed by Sonnenburg and colleagues [13] which uses a support vector machine (SVM) with multiple advanced sequence kernels. ARTS is able to achieve a high accuracy with the area under the ROC curve of 92.77% and 93.44% for genomic DNA chunk sizes of 50 and 500 respectively, demonstrating a superiority to Eponine [7], McPromoter [10] and FirstEF [11]. As part of the ARTS system, a large training and testing data set was constructed along with measures for testing and evaluating promoter detection approaches in a consistent fashion. This data set and methodologies are used to compare the results of our approach, RBF-TSS, to ARTS, which has been shown to be the best performing approach previously available. In the comparison section, the performance measures of ARTS, Eponine, McPromoter and FirstEF are listed as they were reported in [13]. Furthermore, we evaluated the performance of a more recent tool, ProStar [14]. ProStar is developed based on a hypothesis that core and proximal regions characterize unique deformation and stiffness properties. From the analysis of the helical stiffness along the human genome, distinctive structural properties were shown to have a strong correlation with annotated TSSs. For a given sequence, ProStar computes a six-dimensional deformation vector v (twist, tilt, roll, shift, slide, rise) for the whole sequence and uses Mahalanobis distance to find the closest class. Due to the limited flexibility of the available ProStar software, it was evaluated at limited number of thresholds and thus the complete ROC and PRC curves were not generated.


We propose a new method to model the positional frequency of oligonucleotides to form a single feature to represent the given sequences for promoter detection. Unlike [8], which measures the frequency at every single base pair position from the TSS, our approach takes the sequence around the TSS and divides it into overlapping windows for which the frequency of oligonucleotides of specific length are measured. A number of different combinations of window sizes, varying overlapping lengths and oligonucleotides length were examined. The combination resulting in the largest area under the ROC curve in classifying the validation data was chosen for the testing phase.

The extracted positional frequency feature is used as an input into RBF-TSS, a classification algorithm for transcription start sites based on a radial basis function neural network (RBFNN). For training, gradient descent learning is used to simultaneously estimate the RBFNN optimal weights, sub-models' centers and sub-models' covariance matrices [15]. RBF-TSS employs a recently published clustering algorithm for initialization that utilizes the large number of available background samples found within genomic DNA [16]. Weight decay is implemented to regularize the classifier [17] and the improved Rprop algorithm (iRprop+) [18] is used for estimating the learning rate factors for the gradient descent learning of the optimal parameters of the network. iRprop+ was shown to be fast, easy to implement and suitable when estimating many different variables since it uses separate learning rate factors for every variable.

The same experiment setting published to test the ARTS method and others in [13] is used to evaluate RBF-TSS. The proposed method showed to be superior to the ARTS in terms of the area under the ROC curve but not in terms of the area under precision recall curve (PRC). However, the PRC might not be a suitable measure of the performance of promoter identification tools since some samples labeled as true negatives might indeed be novel promoter regions. For example, removal of a 100 negative samples out a million causes the area under the PRC to increase by 6.36 and 10.86 with chunk sizes of 50 and 500, respectively, while the area under the ROC remains nearly identical.


Feature Prototype (Local Oligonucleotide Frequencies)

Promoter regions function as such due to the co-occurrence of a specific set of motifs at specific yet flexible distances from the TSS [5], [6]. However, none of the published studies or tools has found a single common pattern that can explain all promoters, indicating the likelihood of multiple promoter patterns.

In order to capture the characteristics of the given promoter sequences, training sequences with known TSS are divided into overlapping regions (Fig. 1). Either 4-mer or 3-mer oligonucleotide frequencies are measured in every sub-region. All of these sub-frequencies are combined to form a feature vector to describe and represent the given sequence sample. This approach is a compromise between methods that use the frequencies of all oligonucleotides around the TSS regardless of their positions, and those that measure positional densities at every single base relative to the TSS. Knowing the region in which each oligonucleotide occurs yields approximate positional information about the motifs.

Figure 1. Training sequences are divided around the TSS with overlapping regions.

This specific subdivision shows feature 7 settings, as described in Table 1.

Eight combinations of region lengths and overlap sizes are tested to extract separate features, including seven with oligonucleotide of length four and one with oligonucleotide of length three. The overlapping regions considered for each of these combinations are listed in Table 1, with the position relative to the known TSS. These regions are further illustrated in (Fig. 1) for combination seven. In general, regions and overlap areas close to the TSS are short and increase in length as they go farther from the TSS. This is due to the knowledge that common motifs in the core promoter region (close to the TSS) are found to have more strict positions than common motifs found in the promoter proximal region area (farther from the TSS) [5], [6]. After each combination is considered, the one resulting in a classifier with the highest area under the ROC for the validation data is selected for testing.

Table 1. Sub-regions and oligonucleotide lengths considered for feature extraction.

Radial basis function (RBF)

For learning and classification, a modified version of the radial basis function network trained by three learning phases is employed [15]. Radial basis functions [19] are composed of three layers: input, hidden and output (Fig. 2). The hidden layer nodes use radial basis functions such as a Gaussian membership while the output layer is a weighted sum of the outputs from the hidden layer nodes. Such a network has been shown to be useful in classification problems [20].

Typically, training radial basis function neural networks is performed in two phases. First, the parameters (means and variances) of the hidden layers nodes are estimated using clustering or a density estimation algorithm. Afterward, either gradient descent or a pseudo inverse solution is used to estimate the optimal weights to minimize the error criterion described in Eqn. (1) Where is assigned the value of 0 or 1 depending on the true label of training sample and is the output score computed by the network using Eqn. (2).(1)(2)

In Eqn. (2) is the weight assigned to node (j) in the hidden layer and is the membership of sample to node (j). In the case of the Gaussian function being used to compute the membership, is computed using Eqn. (3).(3)

It has been shown that using a third phase learning process where the means, variances and the weight are all being estimated simultaneously by gradient descent and back propagation provides significant improvement on classification accuracy [15].

We improve on the three phase learning RBF in three different ways. First, instead of initializing the hidden layer nodes using the K-means clustering algorithm, we initialize them using a modified k-means algorithm accompanied by split and merge operations [16] where abundant background samples are used to estimate the number of clusters while at the same time avoiding non-descriptive local minimums. Clustering is performed among promoter samples only while non-promoter samples are considered background. Split and merge operations are performed in a direction to minimize the overlap between the clusters of promoters and background samples.

The second improvement is derived from observations in neural networks where it has been demonstrated that keeping weights at low variation and small values increases the performance of classifier [17]. This is accomplished by adding a new term to the objective function in Eqn. (1) that penalizes the large weight values using Eqn. (4).(4)

In Eqn. (4), is a constant determined by validation data. After adding the new term and using gradient descent, it can be shown that in order the minimize the error value for Eqn. (4) the weights, means and variances need to be iteratively updated as given in Eqns. (5–7), respectively.(5)(6)(7)

In Eqns. (5–7), are the mean and the standard deviation of node j along dimension z while is an estimated learning rate factor.

The third improvement over the three phase RBF learning algorithm is to replace the common learning rate factor by separate factors for every variable and use the improved RProp algorithm (iRprop+) [18] to estimate learning factors at every iteration. The iRprop+ has been shown to increase the speed of learning by adaptively estimating separate learning rates for every variable. This last step is critical since there are different variables that are scaled differently and hence are very likely to demand changes with different rates. Furthermore, the iRprop+ algorithm employs a backtracking mechanism where updates that worsen the learning are rescinded.

Training and model selection

Eight different features were extracted as described in the “Feature Prototype” section. Each dimension was normalized by dividing by the mean. Clustering to initialize the RBF network was performed using k-means with split and merge operations as described in [16]. We used the default settings with merge and split thresholds of 0.5 and 0.9 respectively while the clustering misclassification of the background samples was weighted by 0.5. The large thresholds and the weighting correspond to accepting relatively high noise to address the abundance of background samples and to avoid a large number of clusters.

Initially, for every feature, a separate RBF network was constructed without weight regularization (λ = 0). The two best performing features in classifying validation data were chosen for further training. Those two features were four and seven (Table 1). Both features were extracted by measuring the frequency 4-mers in four overlapping sub-regions of the given sequences as described in Table 1. Afterward, different values for λ (0.5, 1, 2, 4, 8, 16, 32, 64 and 256) to regularize the weights were tried with both features seven and four separately. Feature seven with λ = 64 was found to generate the best performance with an area under the ROC curve of 93.58% for validation data and 96.7% for training data.

Figure 3 shows the average single base validation data score of the final network in the range [−600 to 600] around the known TSS position compared to the average score for negative examples. At every base, the feature vector was extracted using sub-regions as if that base was the TSS. It is clear from the curve that the classifier is able to produce output scores capable of distinguishing positive from negative examples. These scores get significantly higher the closer we get to the true TSS.

Figure 3. Average scores at positions around the true TSS vs. average scores of negative examples in validation data.

The x-axis represents the relative position to the true TSS within the positive examples.

Given the high dimensionality of the proposed feature prototype and the different choices, building the proposed model with the different parameters for model selection demanded heavy computation. The approximate time needed to build a whole model for a single feature choice varied. Using a 3.0 GHz Xeon processor, a single clustering demanded 8–14 hours while training the un-regularized RBF network took 7–9 hours and the time needed for convergence increased as the regularization parameter increased up to 3× with λ = 64. On the other hand, a memory of 2GB was quite enough for a single process. However, with the availability of multi-core processors, we were able to cut the training time significantly as we tried different configurations on different cores.


Data set

The data set used for evaluating ARTS [13] was downloaded from ( and used to evaluate RBF-TSS. This data set is divided into three parts: training, validation and testing. As a summary of the ARTS paper, the training and validation were extracted from the dbTSS version 4 (dbTSSv4) [21] which is based on the UCSC human genome sequence assembly and annotation version 16 (“hg16”) [22]. RefSeq [23] identifiers from dbTSSv4 were used to extract the corresponding mRNA using NCBI nucleotide batch retrieval. Afterward, they aligned all the retrieved mRNA from NCBI to hg16 genome using BLAT [24]. The best alignment position at the genome was compared to the putative TSS positions as stated in dbTSSv4. Sequences whose positions did not meet the following checks were discarded: 1.Chromosome and strand of the TSS position and of the best BLAT hit match. 2. The TSS position is within 100 base pairs from the gene start as found by the BLAT alignment. 3. There does not exist a processed putative TSS within 100 bp of the current one. A total of 8,508 genes were accepted and positive examples were extracted as a window of size [−1200, +1200] around the TSS.

For this dataset, 85,042 negative samples were created by randomly extracting 10 subsequences of window length [−1200, +1200] from the interior of every gene between 100 bp downstream of the known TSS and the end of the gene [9]. This method is arguable since it cannot be guaranteed these negative samples do not contain promoters. However, it is near certain most of the extracted negative samples are true negatives since TSS are found to be rare compared to the size of the genome. Furthermore, there is not any other natural method of recognizing true negatives in the genome.

The 8,508 positive and 85,042 negatives examples were both divided into 50% for training and 50% for validation. The testing data set was extracted as the set of all new genes from dbTSSv5 [25] which is based on hg17 and did not appear in dbTSSv4. Genes that have more than a 30% mRNA overlap are removed from consideration.

Testing procedure

We performed the same testing procedure as described in [13]. Every chromosome strand was divided into non-overlapping chunks of size 50 and 500 bases. Any chunk that falls within 20 bp from any known TSS position of any of the testing genes was considered as a positive sample. Any chunk that falls between +20 bp downstream of the start of any of these genes to the end of the same gene and was not labeled positive was considered a negative sample. In the case of chunks of size 50, the number of positive and negative examples were 1,588 and 1,087,666 respectively while in the case of chunks of size 500 they were 943 and 108,782 respectively. Non- ACGT bases (i.e. long runs of N's) were randomly substituted by A, T, C or G.

For every chunk, a feature vector was extracted at every single base as if that base was the TSS position. A network score is computed at every base and each chunk is assigned the maximum value found for any of the bases contained within it. This may result in chunking and labeling of positive samples despite being up to 20 bp away from the true TSS. This is by design to acknowledge the flexibility of POL-II which does not always bind to a specific single base but rather anywhere in the range [−20, +20] from the start of the TSS. The difference in distribution of scores calculated by RBF-TSS for true TSS and non-TSS sequences is shown in (Fig. 3).

The true positive rate (TPR) for TSS identification was calculated as the percentage of positive samples identified as such by RBF-TSS while the false positive rate was calculated as the percentage of true negative samples mistakenly labeled as positive. A comparison of these rates is shown in Figs. 4 and 5. The positive predictive value (PPV) is calculated as the ratio of the positive samples whose true label is positive to the total number of samples classified as positive. As illustrated in Fig. 5, the area under the precision recall curve is relatively low due to the fact that the ratio of negative to positive samples is very high, and varies widely between the two cases of chunk size of 50 and 500.

Figure 4. ROC curve for chunk sizes 50 and 500.

Both axes are scaled to logarithm base 10 to highlight the difference.

Comparison to Other Methods

The performance of RBF-TSS was compared to other methods using both the area under the ROC and PRC curves (Table 2). Note that the results for the ARTS, Eponine, McPromoter and FirstEF methods are taken as reported in [13]. As seen in Table 2, the proposed method has better performance in terms of area under the ROC curve in both chunk size cases 50 and 500. Furthermore, the similar performance between chunks of size 50 and 500 indicates high locality of the proposed method for locating the TSS positions as compared to the other methods.

On the other hand, the proposed method fails to exceed the ARTS method when using area under precision recall curve. This should be of no surprise since it has been analytically shown in [26] that optimizing the area under the ROC curve is not guaranteed to optimize the area under the PRC curve.

The precision recall curve is found to be very sensitive to having few negative samples with high scores with RBF-TSS. For example, the removal of the 100 negative samples with the highest network scores results in a change of the auPRC from 24.08% to 30.44% and 54.64% to 65.5% for chunk sizes of 50 and 500 respectively. In contrast, the change in the auROC was minimal, increasing from 94.75% to 94.76% and 95.08% to 95.14% for chunk sizes of 50 and 500 respectively. These 100 samples represent less than 0.1% of the negative samples, yet their removal illustrates the sensitivity of the PRC. The use of the auPRC should be considered with caution as an evaluation measure of TSS finders since the PRC has a demonstrated sensitivity. Mislabeled negative samples could be unknown TSS, which is shown to potentially have a significant effect on the auPRC.


A new novel feature is proposed that transforms the problem from sequences and temporal space to Euclidian space. Such a feature makes it possible to cluster promoter sequences and build an RBF neural network.

A key advantage of the proposed method is that once training the RBF network is finished, the set of resulting neurons with positive weights can be perceived as a mixture of Gaussians representing promoter samples probability distribution in the new Euclidean space. Such knowledge can pave the way for a higher level analysis in the time space. For example, having many promoter sequences with high membership to one neuron indicates that they belong to one cluster and hence share many of their of oligonucleotides' frequencies in the same sub-regions. Therefore, it becomes more efficient to restrict motif searching or multiple alignment to this set of promoters.

The proposed RBF-TSS method has demonstrated high accuracy performance in detecting transcription start sites and proven to be very competitive to the high performing ARTS tool and others. The proposed method achieved area under the ROC of 94.75% and 95.08% for chunks of size 50 and 500 as compared to 92.77% and 93.44% achieved by the ARTS using the same data set and testing procedure. The high performance of the proposed method with chunk size of 50 proves that RBF-TSS has increased the classification accuracy over previously described TSS prediction algorithms, and performs well with high locality precision.

An executable Java JAR file for RBF-TSS is available for free download at: This website contains additional supporting materials, including training and testing data and a more detailed description of the RBF-TSS algorithm.

Author Contributions

Conceived and designed the experiments: RNM ECR. Performed the experiments: RNM. Analyzed the data: RNM ECR. Contributed reagents/materials/analysis tools: RNM. Wrote the paper: RNM ECR.


  1. 1. Suzuki Y, Tsunoda T, Sese J, Taira H, Mizushima-Sugano J, et al. (2001) Identification and characterization of the potential promoter regions of 1031 kinds of human genes. Genome Res 11: 677–684.Y. SuzukiT. TsunodaJ. SeseH. TairaJ. Mizushima-Sugano2001Identification and characterization of the potential promoter regions of 1031 kinds of human genes.Genome Res11677684
  2. 2. Bajic VB, Choudhary V, Hock CK (2004) Content analysis of the core promoter region of human genes. In Silico Biol 4: 109–125.VB BajicV. ChoudharyCK Hock2004Content analysis of the core promoter region of human genes.In Silico Biol4109125
  3. 3. Kondrakhin YV, Kel AE, Kolchanov NA, Romashchenko AG, Milanesi L (1995) Eukaryotic promoter recognition by binding sites for transcription factors. Comput Appl Biosci 11: 477–488.YV KondrakhinAE KelNA KolchanovAG RomashchenkoL. Milanesi1995Eukaryotic promoter recognition by binding sites for transcription factors.Comput Appl Biosci11477488
  4. 4. Prestridge DS (1995) Predicting Pol II promoter sequences using transcription factor binding sites. J Mol Biol 249: 923–932.DS Prestridge1995Predicting Pol II promoter sequences using transcription factor binding sites.J Mol Biol249923932
  5. 5. Werner T (1999) Models for prediction and recognition of eukaryotic promoters. Mamm Genome 10: 168–175.T. Werner1999Models for prediction and recognition of eukaryotic promoters.Mamm Genome10168175
  6. 6. Kel-Margoulis OV, Kel AE, Reuter I, Deineko IV, Wingender E (2002) TRANSCompel: a database on composite regulatory elements in eukaryotic genes. Nucleic Acids Res 30: 332–334.OV Kel-MargoulisAE KelI. ReuterIV DeinekoE. Wingender2002TRANSCompel: a database on composite regulatory elements in eukaryotic genes.Nucleic Acids Res30332334
  7. 7. Down TA, Hubbard TJ (2002) Computational detection and location of transcription start sites in mammalian genomic DNA. Genome Res 12: 458–461.TA DownTJ Hubbard2002Computational detection and location of transcription start sites in mammalian genomic DNA.Genome Res12458461
  8. 8. Narang V, Sung WK, Mittal A (2005) Computational modeling of oligonucleotide positional densities for human promoter prediction. Artif Intell Med 35: 107–119.V. NarangWK SungA. Mittal2005Computational modeling of oligonucleotide positional densities for human promoter prediction.Artif Intell Med35107119
  9. 9. Bajic VB, Tan SL, Suzuki Y, Sugano S (2004) Promoter prediction analysis on the whole human genome. Nat Biotechnol 22: 1467–1473.VB BajicSL TanY. SuzukiS. Sugano2004Promoter prediction analysis on the whole human genome.Nat Biotechnol2214671473
  10. 10. Ohler U (2000) Promoter prediction on a genomic scale–the Adh experience. Genome Res 10: 539–542.U. Ohler2000Promoter prediction on a genomic scale–the Adh experience.Genome Res10539542
  11. 11. Davuluri RV, Grosse I, Zhang MQ (2001) Computational identification of promoters and first exons in the human genome. Nat Genet 29: 412–417.RV DavuluriI. GrosseMQ Zhang2001Computational identification of promoters and first exons in the human genome.Nat Genet29412417
  12. 12. Bajic VB, Seah SH (2003) Dragon gene start finder: an advanced system for finding approximate locations of the start of gene transcriptional units. Genome Res 13: 1923–1929.VB BajicSH Seah2003Dragon gene start finder: an advanced system for finding approximate locations of the start of gene transcriptional units.Genome Res1319231929
  13. 13. Sonnenburg S, Zien A, Ratsch G (2006) ARTS: accurate recognition of transcription starts in human. Bioinformatics 22: e472–e480.S. SonnenburgA. ZienG. Ratsch2006ARTS: accurate recognition of transcription starts in human.Bioinformatics22e472e480
  14. 14. Goñi JR, Pérez A, Torrents D, Orozco M (2007) Determining promoter location based on DNA structure first-principles calculations. Genome Biol 8: R263.JR GoñiA. PérezD. TorrentsM. Orozco2007Determining promoter location based on DNA structure first-principles calculations.Genome Biol8R263
  15. 15. Schwenker F, Kestler HA, Prestridge DS (2001) Three learning phases for radial-basis-function networks. Neural Netw 14: 439–458.F. SchwenkerHA KestlerDS Prestridge2001Three learning phases for radial-basis-function networks.Neural Netw14439458
  16. 16. Mahdi RN, Rouchka EC (2008) Model based unsupervised learning guided by abundant background samples. Proceedings of the Seventh International Conference on Machine Learning and Applications (ICMLA '08) 203–210.RN MahdiEC Rouchka2008Model based unsupervised learning guided by abundant background samples.Proceedings of the Seventh International Conference on Machine Learning and Applications (ICMLA '08)203210
  17. 17. Moody JE, Hanson SJ, Krogh A, Hertz JA (1995) A simple weight decay can improve generalization. Advances in Neural Information Processing Systems 4: 950–957.JE MoodySJ HansonA. KroghJA Hertz1995A simple weight decay can improve generalization.Advances in Neural Information Processing Systems4950957
  18. 18. Igel C, Husken M (2003) Empirical evaluation of the improved Rprop learning algorithms. Neurocomputing 50: 105–123.C. IgelM. Husken2003Empirical evaluation of the improved Rprop learning algorithms.Neurocomputing50105123
  19. 19. Broomhead DS, Lowe D (1988) Multivariable functional interpolation and adaptive networks. Complex Systems 2: 321–355.DS BroomheadD. Lowe1988Multivariable functional interpolation and adaptive networks.Complex Systems2321355
  20. 20. Orr MJL (2008) Introduction to Radial Basis Function Networks. MJL Orr2008Introduction to Radial Basis Function Networks.Available: Accessed 2009 Feb 17. Available: Accessed 2009 Feb 17.
  21. 21. Suzuki Y, Yamashita R, Nakai K, Sugano S (2002) DBTSS: DataBase of human Transcriptional Start Sites and full-length cDNAs. Nucleic Acids Res 30: 328–331.Y. SuzukiR. YamashitaK. NakaiS. Sugano2002DBTSS: DataBase of human Transcriptional Start Sites and full-length cDNAs.Nucleic Acids Res30328331
  22. 22. Karolchik D, Kuhn RM, Baertsch R, Barber GP, Clawson H, et al. (2008) The UCSC Genome Browser Database: 2008 update. Nucleic Acids Res 36: D773–D779.D. KarolchikRM KuhnR. BaertschGP BarberH. Clawson2008The UCSC Genome Browser Database: 2008 update.Nucleic Acids Res36D773D779
  23. 23. Wheeler DL, Barrett T, Benson DA, Bryant SH, Canese K, et al. (2008) Database resources of the National Center for Biotechnology Information. Nucleic Acids Res 36: D13–D21.DL WheelerT. BarrettDA BensonSH BryantK. Canese2008Database resources of the National Center for Biotechnology Information.Nucleic Acids Res36D13D21
  24. 24. Kent WJ (2002) BLAT–the BLAST-like alignment tool. Genome Res 12: 656–664.WJ Kent2002BLAT–the BLAST-like alignment tool.Genome Res12656664
  25. 25. Yamashita R, Suzuki Y, Wakaguri H, Tsuritani K, Nakai K, Sugano S (2006) DBTSS: DataBase of Human Transcription Start Sites, progress report 2006. Nucleic Acids Res 34: D86–D89.R. YamashitaY. SuzukiH. WakaguriK. TsuritaniK. NakaiS. Sugano2006DBTSS: DataBase of Human Transcription Start Sites, progress report 2006.Nucleic Acids Res34D86D89
  26. 26. Davis J, Goadrich M (2006) The relationship between Precision-Recall and ROC curves. Proceedings of the 23rd International Conference on Machine Learning 233–240.J. DavisM. Goadrich2006The relationship between Precision-Recall and ROC curves.Proceedings of the 23rd International Conference on Machine Learning233240