Home | About | Journals | Submit | Contact Us | Français |

**|**BMC Bioinformatics**|**v.11(Suppl 1); 2010**|**PMC3009523

Formats

Article sections

- Abstract
- Background
- Methods
- Results
- Discussion
- Conclusion
- Competing interests
- Authors' contributions
- References

Authors

Related links

BMC Bioinformatics. 2010; 11(Suppl 1): S50.

Published online 2010 January 18. doi: 10.1186/1471-2105-11-S1-S50

PMCID: PMC3009523

Tina P George: moc.liamg@tasucgpanit; Tessamma Thomas: ni.ca.tasuc@sset

Selected articles from the Eighth Asia-Pacific Bioinformatics Conference (APBC 2010)

Laxmi Parida and Gene Myers

The Eighth Asia Pacific Bioinformatics Conference (APBC 2010)

18-21 January 2010

Bangalore, India

Copyright ©2010 George and Thomas; licensee BioMed Central Ltd.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This article has been cited by other articles in PMC.

This paper compares the most common digital signal processing methods of exon prediction in eukaryotes, and also proposes a technique for noise suppression in exon prediction. The specimen used here which has relevance in medical research, has been taken from the public genomic database - GenBank.

Here exon prediction has been done using the digital signal processing methods viz. binary method, EIIP (electron-ion interaction psuedopotential) method and filter methods. Under filter method two filter designs, and two approaches using these two designs have been tried. The discrete wavelet transform has been used for de-noising of the exon plots.

Results of exon prediction based on the methods mentioned above, which give values closest to the ones found in the NCBI database are given here. The exon plot de-noised using discrete wavelet transform is also given.

Alterations to the proven methods as done by the authors, improves performance of exon prediction algorithms. Also it has been proven that the discrete wavelet transform is an effective tool for de-noising which can be used with exon prediction algorithms.

Genes in eukaryotic cells have two sub-regions, exons and introns [1], depicted in Figure Figure1.1. A preliminary step in the analysis of genomic data, known as DNA-splicing or exon prediction, determines the locations of the exons. The four bases of each strand of the DNA double-helix - Adenine, Thymine, Guanine, and Cytosine are represented distinctly in a genomic sequence with the letters A, T, C, and G to [1]. Protein-coding regions in a DNA sequence-exons (Figure (Figure1)1) exhibit a period-3 property [1] because of the codon structure involved in the translation of base sequences into amino acids [2,3]. The period-3 property is in general regarded as a good preliminary indicator of exon locations, although there are certain exceptions [2]. Digital Signal Processing (DSP) techniques which exploit this period 3 property for exon prediction make use of DSP tools like the Discrete Fourier transform (DFT) [4] or bandpass digital filters [5]. Trevor W. Fox and Alex Carreira [6] have proposed a method of reduced computation to map out exons in a genomic sequence, suppressing noise to a greater degree. But the drawback of all these methods is the continued presence of inter-exon noise. We have used the Discrete Wavelet Transform (DWT) to achieve greater noise suppression [7]. To design any exon prediction algorithm, first step is to convert the sequences of letters from the four-character alphabet into binary sequences conducible to digital signal processing. The numerical sequence resulting from a character string of length N can be written as

(1)

*u*_{A }[*n*], *u*_{T }[*n*], *u*_{C }[*n*], and *u*_{G}[*n*] are the *binary indicator sequences*, which take the value of either 1 or 0 at location *n*, depending on whether the corresponding character exists or not, respectively, at *n*. Here we have taken values of a, t, c, g as 1. The string ACCTG has *N *= 5 and is called the *length *of the sequence. Also,

(2)

Many digital signal processing methods have been tried for genomic data analysis with proven results [1,4-6,9,10], are but a few examples of such published work.

This method [4] uses the binary indicator sequences obtained as described above, the DSP tool used being the DFT. As per the classical definition [11], DFT of a sequence *x*[*n*], of length *N*, is itself another sequence *X*[*k*], of the same length *N*.

(3)

The sequence *X*[*k*] provides a measure of the frequency content at "frequency" *k*, which corresponds to an underlying period of *N/k *samples. Using the above definition the *U*_{A}[*k*] , *U*_{T}[*k*] , *U*_{C}[*k*], and *U*_{G}[*k*] are the DFTs of the binary indicator sequences *u *_{A}[*n*], *u*_{T}[*n*], *u*_{C}[*n*], and *u*_{G}[*n*], respectively and then it follows that:

(4)

As already mentioned here, a = t = c = g = 1.

(5)

has been used as a measure of the total power spectral content of the DNA character string, at "frequency" *k*. But we've found [8] that

(6)

gives better results than the one given in equation 5. The period-3 property of a DNA sequence implies that the DFT coefficients corresponding to *k *= *N*/3 is large. Thus if we take *N *to be a multiple of 3 and plot S[*k*] then we should see a peak at the sample value *k *= *N*/3. Instead of evaluating the DFT of a full-length sequence, DFTs of several of its subsequences, (STFT) was computed for better time domain resolution by sliding the window by one entry in the sequence.

In this method, described in [11], letters of the DNA sequence A, T, C, G are replaced with the electron ion interaction pseudo-potentials(EIIP) of nucleotides. If we substitute the EIIP values in x[n], we get a numerical sequence the 'EIIP indicator sequence', x_{e}[n] which represents the distribution of the free electrons' energies along the DNA sequence, for A, T, C, G the values are 0.126, 0.1335, 0.134, 0.0806 respectively. Next, DFT is evaluated and the corresponding value of the power spectrum is

(7)

When Se[k] is plotted against k, it reveals a peak at N/3 for a coding region and no such peak is observable for a noncoding region. Rectangular windows were used in this work, for evaluating the STFT by breaking up the long sequence into subsequences.

Digital filtering methods used for identification of exons make use of the period-3 behaviour [5] coding regions. The output of an antinotch filter, with a sharp gain at the frequency 2*π*/3 provides this information as a function of base location. This filter [5] has an impulse response *w(n) *given by,

(8)

Let *H*(*z*) be a narrow band bandpass or anti-notch digital filter with a sharp passband cantered at *ω*_{0 }= 2*π*/3. With the indicator sequence *x*_{G}(*n*) taken as input, let *y*_{G}(*n*) denote its output. In the coding regions, the sequence *x*_{G}(*n*) is expected to have a period-3 component, which means that it has large energy in the filter passband. So the output *y*_{G }(*n*) should be comparatively large in the coding regions as demonstrated in Figure Figure2.2. With similar notation for the other bases, define

(9)

A plot of this function is a preliminary indicator of coding regions. Filter 2 designed by the authors [6] gives better result than this anti-notch filter-Filter 1, called so in this paper.

The design [5] starts by considering second order all-pass filter, *A(z)*.

(10)

Now consider a filter bank with two filters *G*(*z*) and *H*(*z*) defined as,

(11)

Then *G*(*z*) has the form

(12)

*G*(*z*) is a notch filter with a zero at the frequency *w*_{0}.

(13)

(14)

H(z) is the required anti-notch filter with magnitude and phase responses as in Figure Figure33.

Filter 2, in this paper is an IIR single peaking filter with the peak frequency at 2*π*/3. This was designed using the built-in utility of MATLAB [6]. Its magnitude and phase response is shown in Figure Figure44.

The number of digital filter operations can be reduced from four to one [6] by creating a new signal that encapsulates the entire DNA sequence *u*_{A+C+T+G}(*n*) = *au*_{A}(*n*) + *cu*_{C}(*n*) + *tu*_{T}(*n*) + *gu*_{G}(*n*) where *a*, *c*, *t*, and *g *are real-valued parameters.. A long DNA sequence can be approximated using a two-symbol representation, where one symbol is either A or T and the other symbol is either C or G as they are complimentary to each other. Also capitalizes on the strong periodicity exhibited by the G sequence. In this case, the signal becomes

(15)

The above methods of gene splicing, though give results, better reduction in noise and accuracy of prediction is desired. The statistically optimal null filter to improve prediction of exons has been suggested by Kakumani et. al. [10]. Here we've tried to improve the accuracy of a gene splicing algorithm using the Discrete Wavelet Transform (DWT). In DWT [12], the signal is passed through a series of high and low pass filters to analyze the respective frequencies followed by a scaling. The scale is changed by upsampling and downsampling (subsampling) operations. Subsampling reduces the sampling rate, or removes some of the samples of the signal. Upsampling increases the sampling rate of a signal by adds new samples. Filtering involved is explained as follows. If a signal has a maximum of 1000 Hz component, then half band low-pass filtering removes all the frequencies above 500 Hz. However it is to be recalled that with discrete signals, frequency *ω *is expressed in terms of radians. Accordingly, the sampling frequency of the signal is equal to 2*F*_{m}, Hz, in the analog domain and 2*π *radians in terms of discrete radial frequency. Therefore, the highest frequency component in a discrete signal will be *π *radians. Hz is not appropriate for discrete signals, but used for clarity of the idea.

Decomposition of the signal into different frequency bands is obtained by successive high pass and low pass filtering of the time domain signal. The original signal x[n] is first passed through a halfband, highpass filter g[n] and a lowpass filter h[n]. After the filtering, half of the samples can be eliminated ie. subsampled by 2, by discarding every other sample. This constitutes one level of decomposition, mathematically expressed as:

(17)

(18)

h[n] and g[n] are the sample sequences or impulse responses and y_{high}[k] and y_{low}[k] are the outputs of the highpass and lowpass filters, respectively, after subsampling by 2. This decomposition halves the time resolution since only half the number of samples now characterizes the entire signal. However, this operation doubles the frequency resolution, since the frequency band of the signal now spans only half the previous frequency band. The above procedure, known as subband coding, can be repeated for further decomposition. At every level, the filtering and subsampling will result in half the number of samples (and hence half the time resolution) and half the frequency band spanned (and hence double the frequency resolution). Figure Figure55 illustrates this procedure.

The bandwidth of the signal at every level is marked on the figure as "f". The DWT of the original signal is obtained by concatenating all coefficients starting from the last level of decomposition (remaining two samples, in this case) and will have the same number of coefficients as the original signal. The difference of this from the Fourier transform is that the time localization of these frequencies will not be lost, a key advantage. Good time resolution is obtained at high frequencies, and good frequency resolution at low frequencies. All algorithms mentioned in this work were implemented using MATLAB.

Figures Figures6,6, ,7,7, ,8,8, ,9,9, ,10,10, ,11,11, ,12,12, ,13,13, ,1414 are the results of the algorithms described in this work applied on exons in nucleotide sequence of the gene F56F11.5 of C elegans [GenBank: AF099922]. The authors have tried the DSP methods on genomic sequences of four different specimen - C elegans, Mus musculus, Sus scrofa and Homo sapien, but only the results obtained with organism C elegans has been included here due to lack of space. *Caenorhabditis elegans *is a free living nematode (roundworm), about 1 mm in length, which lives in temperate soil environments. The bases are 1...42799 long and 8000 nucleotides from location 7021 have been considered which according to the NCBI data base has five exons.

Results obtained are the exon plots shown in Figures Figures66 and and77 respectively. Of the gene splicing algorithms mentioned here, the ones which make use of the DFT are the Binary method and the EIIP method. C elegans gives best result for a window length of 240. The boundary of exons is more well defined with this window. A window size of 351 though reduces inter-exon noise, the exon boundaries tend to shift, its not shown here.

The results obtained with digital filtering is shown in Figures Figures88 to to11.11. The filter designed by the authors named Filter 2 here, gives better results than Filter 1[5]. The noise suppression technique with reduced computation [6] reduces inter-exon noise to a great. Exon plot 5 shows that even the noise suppression technique when used with the filter 1 fails to give the desired results, but very effective when used in conjunction with the filter 2 as seen from exon plot 6 (Figure (Figure11).11). But even then, the first exon located between 7947 and 8059, with relative position in the plot, 926 - 1079 cannot be distinguished from the surrounding inter-exon noise. The noise peaks as seen in the exon plot 5 (Figure (Figure10,10, reduced computation technique with filter 2) are stronger than the half power values of the exon peaks. It's evident that these methods need improvement. Hence DWT de-noising has been tried. The best results as obtained from reduced computation technique with IIR anti-notch filtering using filter 2 was used for further treatment with DWT. All the results are shown in tabular form in table table11 against standard exon lengths give in the NCBI database.

Figure Figure1212 mentioned in the results section shows the detail coefficients and Figure Figure1313 shows the approximation coefficients of Haar decomposition respectively. The final exon plot obtained after DWT treatment are given in Figure Figure14.14. Notice that the in exon plot 6, Figure Figure1111 power levels corresponding to the first exon which had half power values almost equal to the noise levels (exon plot 6) has been accentuated such that there is no mistaking between exon region and intron region. As the signals desired corresponding to exon peaks are in the lower region of the spectrum spanning the 0 - *π*/2 range, against a discrete frequency interval of - *π *to *π*, a single level decomposition and reconstruction was sufficient here. As already mentioned, the region of the genomic sequence of C elegans has 8000 nucleotides from 7021 to 15021. The exon plots in figures figures66 to figure figure1414 show 8000 nucleotide locations with the exons depicted as spectral peaks. The exon boundaries obtained after de-noising with DWT are the same as those obtained with the reduced computation technique using Filter2, as the the exon plot obtained with the method was used for subsequent wavelet decomposition and re-construction. Hence the exon boundaries are not tabulated separately for the de-noised result.

DFT is a conventional frequency analysis tool. Instead of evaluating the DFT of a full-length sequence, the DFTs of several of its subsequences, ie. the STFT was computed for better time domain resolution by sliding the window by one entry in the sequence. It is a known fact that using the STFT increases resolution in time domain. For the first two methods, most of the literature asserts 351 to be the window size, especially for C elegans. But the authors have found that the window size varies with the method adopted and the DNA sequence analyzed. With the DFT used for frequency analysis, the window found to yield better result was 240. The better result obtained with the single peaking IIR filter over the one described in [5] can be attributed to the higher attenuation seen in the stop band of the filter. The use of such a filter has given lesser noise without using the subsequent filter bank mentioned in [5]. DWT is a far more popular and potential signal processing tool today. However it has been used only for noise suppression here. Review of literature did not reveal a formal, randomized comparison of each of engineering methods mentioned here with other non-engineering approaches, hence such a comparison is not presented.

In this paper the authors have shown that appropriate alterations to the classical methods of exon prediction yields better results. For AF099922 C elegans, the window size for the binary and EIIP methods has been found to be 240, whereas for the digital filter method it is 450, as against 351 mentioned in most of the literature. The window size thus should be selected depending on the method of analysis and also on the sequence analyzed. The filter1 as it is called in this paper is the common filter found in literature [3,5]; filter 2 has been designed by the authors. It's clear that this design is much better performance-wise as evident from the results. We have proposed the DWT to de-noise exon prediction, and it has been proved that it is the right tool for de-noising to be used with exon prediction algorithms.

The authors declare that they have no competing interests.

TPG carried out the work and drafted the manuscript under the close guidance of TT who conceived of the study, and participated in its design and coordination. Both authors have read and approved the final manuscript.

I would like to thank the authorities of the Department of Electronics, Cochin University of Science and Technology, Kerala, India, for permitting me to carry out this work under the guidance of Dr. Tessamma Thomas, the second author.

This article has been published as part of *BMC Bioinformatics *Volume 11 Supplement 1, 2010: Selected articles from the Eighth Asia-Pacific Bioinformatics Conference (APBC 2010). The full contents of the supplement are available online at http://www.biomedcentral.com/1471-2105/11?issue=S1.

- Vaidyanathan PP. Genomics and Proteomics: A signal processor's tour. IEEE Circuits ad Systems Magazine, Fourth quarter. 2004. pp. 6–29. [Cross Ref]
- Tiwari S, Ramachandran S, Bhattacharya A, Bhattacharya S, Ramaswamy R. Prediction of probable genes by Fourier analysis of genomic sequences. CABIOS. 1997;13(3):263–270. [PubMed]
- Trifonov EN, Sussman JL. The pitch of chromatin DNA is reflected in its nucleotide sequence. Proceedings of the Nat Acad Sci, USA. 1980;77:3816–3820. doi: 10.1073/pnas.77.7.3816. [PubMed] [Cross Ref]
- Anastassiou D. Frequency-domain analysis of bio-molecular sequences. Bioinformatics. 2000;16(12):1073–1081. doi: 10.1093/bioinformatics/16.12.1073. [PubMed] [Cross Ref]
- Vaidyanathan PP, Yoon BJ. Gene and exon prediction using all-pass based filters. ieeexplore.org.
- Fox TW, Carreira A. A Digital Signal Processing Method for Gene Prediction with Improved Noise Suppression. EURASIP Journal on Applied Signal Processing. 2004;1:108–114.
- George TP, Thomas T. Report of The M Tech Semester IV Project work 2009 April, done at Department of Electronics. Cochin University of Science And Technology, Kerala, India; Improvements in Gene Splicing and Gene Comparison for Anomaly Detection.
- George TP, Thomas T. Report of The M Tech Semester III Project work 2008 December, done at Department of Electronics. Cochin University of Science And Technology, Kerala, India; Exon Prediction Methods in Eukaryotes.
- Nair AS, Sreenadhan S. A coding measure scheme employing electron-ion interaction pseudopotential (EIIP) Bioinformation, Open access hypothesis. 2006. pp. 197–202. [PMC free article] [PubMed]
- Kakumani R, Devabhaktuni V, Ahmad MO. Prediction of protein coding regions in DNA using a model based approach. IEEE Signal Processing Magazine. 2009. [PubMed]
- Proakis JG, Manolakis D. Digital Signal Processing. Fourth. Prentice - Hall of India, Pvt. Ltd; 2007. pp. 454–461.
- Soman KP, Ramachandran KI. Insights into Wavelets - From Theory to Practice. Second. Prentice - Hall of India, Pvt. Ltd; 2004.

Articles from BMC Bioinformatics are provided here courtesy of **BioMed Central**

PubMed Central Canada is a service of the Canadian Institutes of Health Research (CIHR) working in partnership with the National Research Council's national science library in cooperation with the National Center for Biotechnology Information at the U.S. National Library of Medicine(NCBI/NLM). It includes content provided to the PubMed Central International archive by participating publishers. |