Skip to main content

Integrated entropy-based approach for analyzing exons and introns in DNA sequences



Numerous essential algorithms and methods, including entropy-based quantitative methods, have been developed to analyze complex DNA sequences since the last decade. Exons and introns are the most notable components of DNA and their identification and prediction are always the focus of state-of-the-art research.


In this study, we designed an integrated entropy-based analysis approach, which involves modified topological entropy calculation, genomic signal processing (GSP) method and singular value decomposition (SVD), to investigate exons and introns in DNA sequences. We optimized and implemented the topological entropy and the generalized topological entropy to calculate the complexity of DNA sequences, highlighting the characteristics of repetition sequences. By comparing digitalizing entropy values of exons and introns, we observed that they are significantly different. After we converted DNA data to numerical topological entropy value, we applied SVD method to effectively investigate exon and intron regions on a single gene sequence. Additionally, several genes across five species are used for exon predictions.


Our approach not only helps to explore the complexity of DNA sequence and its functional elements, but also provides an entropy-based GSP method to analyze exon and intron regions. Our work is feasible across different species and extendable to analyze other components in both coding and noncoding region of DNA sequences.


Research on Deoxyribonucleic acid (DNA) is a key content and important foundation in biological and life science studies [1, 2]. Functional DNA elements such as genes and noncoding elements are composed of four nucleotides: adenine (A), cytosine (C), guanine (G) and thymine (T). Their functions are basically decided by order of nucleotides. Essential part of genomic sequence analysis is to identify functional elements and their positions in DNA sequence [38], which is a basis for further research on target genes and plays a vital role in species evolution studies.

Information theory is a science which studies the measurement, transmission, exchange and storage of information. Genetics information is supposed to follow the general law of information storage and communication. Therefore, information theory [9, 10] method is a feasible way to analyze genetic information [6, 1113]. As a measure of information complexity, information entropy was first proposed by Shannon in 1948 [10]. It is reasonable to analyze the genome sequence based on information entropy methods. For example, there are different conserved and correlated loci on the DNA sequence and their randomness leads to various information entropy values. Based on the theory of information entropy, people can quantitatively describe the complexity of given sequences and categorize these sequences according to their complexity.

In past decade, entropy-based quantitative analysis methods facilitated calculating sequence complexity and analyzing underlying connections between genetic elements. For instance, the Shannon metric entropy is used to calculate the genomic DNA sequence of different organisms [14] and the Renyi entropy is mainly applied to evaluate randomness of the DNA sequence [15]. The diffusion entropy can be used to analyze the complexity of promoter region of the human genome [5]. Topological entropy [16, 17] and generalized topological entropy [17] are able to analyze the finite length DNA sequence [10, 13, 18, 19]. These genomic sequence analysis methods based on information entropy have obtained a series of research results. Recently, genetic information is generated exponentially with the development of next-generation technology, which puts forward higher requirements for entropy-based quantitative methods.

Genomic signal processing (GSP), which is based on digital signal processing (DSP), has been widely applied in DNA sequence studies in recent years [2028]. In general, four nucleotides T, C, G and A are converted to corresponding numerical values and the whole sequence is presented by numerical sequence. Then the numerical sequences are analyzed by the algorithms in accordance with various purposes. Different GSP methods have their own rules of conversion and algorithms. And they are used in genetic sequence comparison [26, 27, 29], sequence alignment [30] and gene prediction [22, 3133]. Specifically, discrete Fourier transform [34], short-time Fourier transform [22] and singular value decomposition (SVD) [3133] have been effectively used to predict exon locations.

In this study, we designed an integrated entropy-based analysis approach, which involves modified topological entropy calculation, genomic signal processing (GSP) method and singular value decomposition (SVD) [32, 33], to investigate exons and introns in DNA sequences. We optimized and implemented the topological entropy and the generalized topological entropy to calculate the complexity of DNA sequences, highlighting the characteristics of repetition sequences. We compared the difference between digitalizing values of exons and introns, and found that a significance level of difference between them is improved with our optimized entropy calculation. After we converted DNA sequences to numerical topological entropy values, we applied SVD method to effectively investigate exon and intron regions on single gene sequences from five species. Our integrative analysis approach is also extendable to study other elements in both coding and noncoding region of DNA sequences.


Data sets

Data sets of exon, intron and promoter for each chromosome on human genome were used in this study (Table 1). We downloaded human genome data hg38 from UCSC ( [35] and acquired sequence information of genomic elements by Galaxy ( [36]. We have filtered out sequences which have length less than 200 base pairs (bp) to lower significant noise.

Table 1 Mean entropy value and number (in parentheses) of exons, introns and promoters on each chromosome in human genome

We used a sequence ranging from 3500–10500 bp from gene AJ229040 to predict exons and introns. The sequence was downloaded from NCBI [37]. Six exon locations are marked as 3770 – 3826 bp, 4584 – 4601 bp, 4671 – 4730 bp, 4999 – 5277 bp, 5730 – 5823 bp and 6719 – 6898 bp. We also used other 15 genes from five species (human, dog, zebrafish, C. elegans and fruitfly) for exon predictions. The sequences were downloaded from Ensembl [38]. The names of these genes are listed in Additional file 1: Table S3.

Modified topological entropy and modified generalized topological entropy

Koslicki proposed topological entropy [16] of a sequence and defined it as follows:

$$ H_{top(\omega)} = \frac{\log_{4}(p_{\omega}(n))}{n} $$

where the finite DNA sequence has a length of ω. Its sub sequence has length of n, where 4n+n−1≤|ω|≤4n+1+(n+1)−1. And pω(n) is the number of sub sequences of length n within first \(\phantom {\dot {i}\!}4^{n_{\omega } }+n_{\omega }-1\) bps of ω. In general, topological entropy reflects the complexity and randomness of a sequence. If the sequence has low entropy, it has less randomness. For example, entropy values of exons are supposed to have lower values than that of introns since exons are more conserved and have relatively fixed functions. Moreover, topological entropy is able to compare sequences with different lengths. Generalized topological entropy is a complete form of topological entropy [19] and it is defined as:

$$ H_{n_{\omega}}^{k}(\omega) = \frac{1}{k}\sum_{i=n_{\omega}-k+1}^{n_{\omega}} \frac{\log_{4}(p_{\omega}(i))}{i} $$

where nω satisfies \(\phantom {\dot {i}\!}4^{n_{\omega }}+n_{\omega }-1 \leq |\omega | \leq 4^{{n_{\omega }}+1}+(n_{\omega }+1)-1\) and kn. pω(i) is the number of different sub sequences within ω. Generalized topological entropy includes contributions from all the sub sequences and measures the complexity of DNA sequence more comprehensively. In our method, we modified both topological entropy and generalized topological entropy. Since all sub sequences are counted in entropy calculations, we optimized entropy calculation by filtering out sub sequences which have lower appearance frequencies. The criterion is that if the counting frequency of a sub sequence is smaller than \(\phantom {\dot {i}\!}{4^{n_{\omega }}}/{\omega }\), this sub sequence will not be counted in the entropy calculation.

Genomic signal processing (GSP) and singular value decomposition (SVD)

Genomic signal processing (GSP) based on digital signal processing (DSP) has been used for exon prediction recently. GSP digitalizes DNA sequence and analyze the numerical sequence with different algorithms. We applied GSP method and singular value decomposition (SVD) method to analyze digitalized DNA sequences. In our study, we digitalized sequences by their entropy value and investigated the functional and conserved regions by using SVD method. SVD is a commonly used approach in matrix analysis. Matrix A is decomposed into three matrixes as follows:

$$ A_{k \times p} = U_{k \times k} S_{k \times p} V_{p \times p}^{T} $$

where UTU=Ik×k and VTV=Ip×p. The columns of U are called the left-singular vectors and those of V are called the right-singular vectors. S is a rectangular diagonal matrix with non-negative real numbers on the diagonal. The diagonal terms σi of S are the singular values of S. And the eigenvalue λ of S is \(\lambda _{i} = \sigma _{i}^{2}\). In some cases, such as when A is a sparse matrix, σi decrease quickly and A can be approximately factorized as:

$$ A_{k \times p} \approx U_{k \times r} S_{r \times r} V_{r \times p}^{T} $$

where r is much smaller than k and p.


Modified generalized topological entropy and its application on exploring complexity of exons, introns and promoters

Topological entropy was proposed by Koslicki [16] to solve entropy calculation quest on finite sequences. Generalized topological entropy was proposed by Wang et al. [17] and is a complete form of topological entropy. Both of them can measure complexity of functional elements such as exons and introns in DNA sequence.

In order to highlight the characteristics of repetition sequences, we modified generalized topological entropy and used it to calculate entropy value of exons, introns and promoters on each chromosome in human genome. After we calculated all entropy, mean values of entropy of exons, introns and promoters are listed in Table 1. Meanwhile, the numbers of exons, introns and promoters in each chromosome are also listed in Table 1. We performed a Kruskal-Wallis test to check whether there were significant differences between them (Additional file 1: Table S1).

We plotted the mean entropy value of exons, introns and promoters on each chromosome in Fig. 1. Figure 1 shows that average modified generalized topological entropy value of exons is lower than that of introns in the same chromosome. The average modified generalized topological entropy value of promoters is lower than that of introns in most chromosomes. Additional file 1: Table S1 shows that differences between exons, introns and promoters are statistically significant.

Fig. 1
figure 1

Modified generalized topological entropy values of introns, exons and promoters

From the definition of information entropy, a sequence is supposed to have lower entropy value if its sequence is less complex and more conserved. Normally exons are more conserved than introns because they carry more selective pressure in evolution process. Our result shows that entropy value of exon is smaller than that of intron, which is consistent with the theory of evolution. Similarly, promoters are highly conserved elements in DNA sequences [5] and they participate key processed in many living cells, remaining essentially unchanged. Promoter regions often have motifs for binding transcription factors. Our result demonstrates that entropy values of promoters are even smaller than those of exons.

Entropy normally measures the variety of sub-sequences and is not directly related to evolutionary conservation. However, some repetition sequences, which lead to small entropy values, are in conserved regions. For example, some motifs for transcription factors binding in promoters are repetition sequences and they might have regulatory functions. These functions make these regions conserved in evolution.

Comparison of the generalized topological entropy and modified generalized topological entropy

We calculated the entropy values of exons, introns and promoters in the way of previously reported generalized topological entropy.

Then we tested the differences between exons, introns and promoters in each chromosome. We found that they were significantly different, and the significant level was lower than that calculated by our proposed modified generalized topological entropy (Additional file 1: Table S1). For example, the p-value of chromosome 2 is 1.52e−14 after we optimized generalized topological entropy calculation, which is less than that from original generalized topological entropy (p=7.43e−10). It is reasonable since we filtered a small proportion of non-repetitive sequences, highlighted the role of repeated sequences in our modified generalized entropy calculation.

Entropy-based genomic signal processing analysis with singular value decomposition on a single gene sequence

As mentioned above, topological entropy value can measure the complexity of a sequence region. Therefore, it is used to investigate exon and intron regions on single gene. We applied modified topological entropy calculation to gene AJ229040 with a sliding window size of 100 bps. With k value set as 2, 3, 4, 5 and 6, we converted each nucleotide base to a matrix with dimension of 1×5. We then applied SVD approach [33, 34] on the whole numerical gene sequence. A portion of SVD curve along 3000 to 7000bp is shown in Fig. 2 and red boxes indicate real locations of exons.

Fig. 2
figure 2

A portion of SVD curve and locations of real exons presented as red box

We plotted receiver operating characteristic (ROC) curve and choose a cut off value as 0.012 to estimate exon and intron regions. In the region from 3500 bp - 10500 bp, the total length of exons is 688 bps. We correctly predicted 122 exon nucleotides and 4708 introns. The closer the ROC curve is to the upper left corner, the higher the overall accuracy of the prediction. The AUC is a measure of how well a feature can distinguish between exon and intron groups. Without using any prior knowledge, the accuracy of our prediction reaches 0.67 (Additional file 1: Table S2) and the area under the curve (AUC) is 0.69 (Fig. 3).

Fig. 3
figure 3

ROC curve for exon and intron prediction in gene AJ229040

To assess the feasibility of our approach across different species, we randomly chose some genes from human, dog, zebrafish, C. elegans and fruitfly from Ensembl genome browser [38]. We performed our exon prediction approach (Additional file 1: Table S3) and plotted ROC curves of prediction results for each gene (Additional file 1: Figure S1). It is noted that the AUC value ranges from 0.55 to 0.81. That means our method for exon prediction based on generalized topological entropy is applicable across species.


There exist a large number of exon prediction methods for a single gene or multiple genes [3, 39]. However, most of them highly rely on prior knowledge such as databases of protein-coding genes. These homology-based methods [40, 41] predict genes by comparing sequence with known database sequences. Therefore, it takes much more time to search through the whole database and produce results. These methods [42, 43] have high prediction accuracy in finding homology sequences. However, they have limitations in detecting other functional elements in other 97 – 98% noncoding genomic regions. The rapid development of next-generation sequencing technology leads to big accumulation of omics data. To discover the underlying biological mechanisms from the massive data, homology-based methods are instructive while time consuming. Therefore, more methods such as entropy-based quantitative methods demonstrate their advantages and are applied to analyze various omics data [4446].

Numerical signal processing approaches are utilized in genomic analysis as genomic signal processing. Generally, information entropy indicates a system status and predicting exon region by just a feature of entropy is a very challenging task. Therefore, we integrated optimized topological entropy and GSP method to calculate complexity of DNA sequences, investigated their application on exon and intron prediction in DNA sequences. We used the same gene which Das and Turkoglu used in their numerical mapping method to predict exons [31]. Their method has higher prediction accuracy than ours since they calculated the entropy based on repetition property of 64 types of codons. Our result is still reasonable since no prior knowledge is used and the prediction only depends on the sequence. That also implies our method to digitalize DNA sequences based on modified generalized entropy is extendable to other element prediction on single sequence or multiple sequences.

To analyze the digitalized DNA sequence, we employed SVD approach in our study. For our case, Uk×r in Eq. 4 refers to the highly related entropy calculation modes for different k and \(V_{r\times p}^{T}\) represents a series of highly associated nucleotide positions. By using SVD method, correlation information on DNA sequence is investigated and the biological meaning is straightforward. In the future, we will include other methods in this integrated entropy-based GSP approach to improve the result of exon prediction and ROC curve for more species.


In conclusion, our exon and intron prediction method, which is based on entropy calculation and genomic signal processing, analyzes complexity of exons and introns and is able to distinguish the exon and intron regions across different species. Our research optimizes the existing topological and generalized topological entropy calculation. This integrated approach is extendable to exon and other functional element prediction on the large-scale genome data.



Deoxyribonucleic acid GSP: Genomic signal processing


Generalized topological entropy


Modified generalized topological entropy


Modified topological entropy


Singular value decomposition


Topological entropy


  1. Watson JD, Devons S. The double helix: A personal account of the discovery of the structure of dna. Phys Today. 1968; 21(8):71–2.

    Article  Google Scholar 

  2. Watson JD, Crick FH. Molecular structure of nucleic acids: a structure for deoxyribose nucleic acid. j.d. watson and f.h.c. crick. published in nature, number 4356 april 25, 1953. Nature. 1974; 248(5451):765. Watson, J D Crick, F H eng Biography Classical Article Historical Article England 1974/04/26 00:00 Nature. 1974 Apr 26;248(5451):765.

    Article  CAS  PubMed  Google Scholar 

  3. Yeh RF, Lim LP, Burge CB. Computational inference of homologous gene structures in the human genome. Genome Res. 2001; 11(5):803–16.

    Article  CAS  PubMed  PubMed Central  Google Scholar 

  4. Mount DM. Bioinformatics: Sequence and Genome Analysis. Second Edition. By David W Mount. Woodbury NY 11797, United States: Cold Spring Harbor Laboratory Press; 2005, pp. 421–38.

    Google Scholar 

  5. Zhao F, Yang H, Wang B. Complexities of human promoter sequences. J Theor Biol. 2007; 247(4):645–9.

    Article  CAS  PubMed  Google Scholar 

  6. Koonin EV, Novozhilov AS. Origin and evolution of the genetic code: the universal enigma. Iubmb Life. 2008; 61(2):99–111.

    Article  CAS  Google Scholar 

  7. Vidulin V, Smuc T, Supek F. Extensive complementarity between gene function prediction methods. Bioinformatics. 2016; 32(23):3645–53.

    CAS  PubMed  Google Scholar 

  8. Vlasblom J, Zuberi K, Rodriguez H, Arnold R, Gagarinova A, Deineko V, Kumar A, Leung E, Rizzolo K, Samanfar B, Chang L, Phanse S, Golshani A, Greenblatt JF, Houry WA, Emili A, Morris Q, Bader G, Babu M. Novel function discovery with genemania: a new integrated resource for gene function prediction in escherichia coli. Bioinformatics. 2015; 31(3):306–10. url10.1093/bioinformatics/btu671.

    Article  CAS  PubMed  Google Scholar 

  9. Bose R, Chouhan S. Alternate measure of information useful for dna sequences. Phys Rev E Stat Nonlinear & Soft Matter Phys. 2011; 83(5):051918.

    Article  CAS  Google Scholar 

  10. Shannon C. A mathematical theory of communication. Bell Syst Tech J. 1948; 27(3):379–423.

    Article  Google Scholar 

  11. Colosimo A, Luca AD. Special factors in biological strings. J Theor Biol. 2000; 204(1):29–46.

    Article  CAS  PubMed  Google Scholar 

  12. Cristea PD. Genetic signal representation and analysis. In: International Symposium on Biomedical Optics, vol. 4623. SPIE: 2002. p. 77–84.

  13. Kirillova OV. Entropy concepts and dna investigations. Phys Lett A. 2000; 274(5–6):247–53.

    Article  CAS  Google Scholar 

  14. Machado JAT. Shannon entropy analysis of the genome code. Math Probl Eng, 2012, (2012-4-22). 2012; 2012(10):243–53.

    Google Scholar 

  15. Vinga S, Almeida JS. Local renyi entropic profiles of dna sequences. BMC Bioinformatics. 2007; 8:393.

    Article  PubMed  PubMed Central  CAS  Google Scholar 

  16. Koslicki D. Topological entropy of dna sequences. Bioinformatics. 2011; 27(8):1061–7.

    Article  CAS  PubMed  Google Scholar 

  17. Jin S, Tan R, Jiang Q, Xu L, Peng J, Wang Y, Wang Y. A generalized topological entropy for analyzing the complexity of dna sequences. PLoS One. 2014; 9(2):88519.

    Article  CAS  Google Scholar 

  18. Chan C, Liang H, Hsiao N, Ko M, Lyu P, Hwang J. Relationship between local structural entropy and protein thermostabilty. Proteins: Struct Funct Bioinforma. 2004; 57(4):684–91.

    Article  CAS  Google Scholar 

  19. Schmitt AO, Herzel H. Estimating the entropy of dna sequences. J Theor Biol. 1997; 188(3):369–77.

    Article  CAS  PubMed  Google Scholar 

  20. Akhtar M, Epps J, Ambikairajah E. Signal processing in sequence analysis: Advances in eukaryotic gene prediction. IEEE J Sel Top Signal Process. 2008; 2(3):310–21.

    Article  Google Scholar 

  21. Abbasi O, Rostami A, Karimian G. Identification of exonic regions in dna sequences using cross-correlation and noise suppression by discrete wavelet transform. BMC Bioinformatics. 2011; 12(1):1–10.

    Article  Google Scholar 

  22. Saberkari H, Shamsi M, Heravi H, Sedaaghi MH. A fast algorithm for exonic regions prediction in dna sequences. J Med Signals Sens. 2013; 3(3):139–49.

    Article  PubMed  PubMed Central  Google Scholar 

  23. Inbamalar TM, Sivakumar R. Improved algorithm for analysis of dna sequences using multiresolution transformation. Sci World J 2015, (2015-4-27). 2015; 2015(5):786497.

    CAS  Google Scholar 

  24. Lorenzo-Ginori JV, Rodriguez-Fuentes A, Abalo RG, Rodriguez RS. Digital signal processing in the analysis of genomic sequences. Current Bioinformatics. 2009; 4(1):28–40.

    Article  CAS  Google Scholar 

  25. Mendizabal-Ruiz G, Roman-Godinez I, Torres-Ramos S, Salido-Ruiz RA, Velez-Perez H, Morales JA. Genomic signal processing for dna sequence clustering. PeerJ. 2018; 6:4264.

    Article  CAS  Google Scholar 

  26. Mendizabal-Ruiz G, Roman-Godinez I, Torres-Ramos S, Salido-Ruiz RA, Morales JA. On dna numerical representations for genomic similarity computation. PLoS One. 2017; 12(3):0173288.

    Article  CAS  Google Scholar 

  27. Li Y, He L, Lucy He R, Yau SS. A novel fast vector method for genetic sequence comparison. Sci Rep. 2017; 7(1):12226.

    Article  PubMed  PubMed Central  CAS  Google Scholar 

  28. Zhao WJJ, Jiang H. Detecting periodicities in eukaryotic genomes by ramanujan fourier transform. J Comput Biol. 2018.

    Article  CAS  PubMed  Google Scholar 

  29. Hoang T, Yin C, Yau SS. Numerical encoding of dna sequences by chaos game representation with application in similarity comparison. Genomics. 2016; 108(3-4):134–42.

    Article  CAS  PubMed  Google Scholar 

  30. Skutkova H, Vitek M, Sedlar K, Provaznik I. Progressive alignment of genomic signals by multiple dynamic time warping. J Theor Biol. 2015; 385:20–30.

    Article  CAS  PubMed  Google Scholar 

  31. Das B, Turkoglu I. A novel numerical mapping method based on entropy for digitizing dna sequences. Neural Comput & Appl. 2018; 29:207.

    Article  Google Scholar 

  32. Akhtar M, Ambikairajah E, Epps J. Detection of period-3 behavior in genomic sequences using singular value decomposition. In: Proceedings of the IEEE Symposium On Emerging Technologies, 2005. Piscataway: IEEE: 2005. p. 13–17.

    Google Scholar 

  33. Alter O, Brown PO, Botstein D. Singular value decomposition for genome-wide expression data processing and modeling. Proc Natl Acad Sci U S A. 2000; 97(18):10101–6.

    Article  CAS  PubMed  PubMed Central  Google Scholar 

  34. Tiwari S, Ramachandran S, Bhattacharya A, Bhattacharya S, Ramaswamy R. Prediction of probable genes by fourier analysis of genomic sequences. Comput Appl Biosci. 1997; 13(3):263–70.

    CAS  PubMed  Google Scholar 

  35. Blankenberg D, Taylor J, Schenck I, He J, Zhang Y, Ghent M, Veeraraghavan N, Albert I, Miller W, Makova KD. A framework for collaborative analysis of encode data: making large-scale analyses biologist-friendly. Genome Res. 2007; 17(6):960–4.

    Article  CAS  PubMed  PubMed Central  Google Scholar 

  36. Blankenberg D, Kuster GV, Coraor N, Ananda G, Lazarus R, Mangan M, Nekrutenko A, Taylor J. Galaxy: A Web-Based Genome Analysis Tool for Experimentalists. New York: John Wiley & Sons, Inc.; 2010.

    Google Scholar 

  37. Sayers EW, Cavanaugh M, Clark K, Ostell J, Pruitt KD, Karsch-Mizrachi I. Genbank. Nucleic Acids Res. 2018.

    Article  PubMed Central  CAS  Google Scholar 

  38. Zerbino DR, Achuthan P, Akanni W, Amode MR, Barrell D, Bhai J, Billis K, Cummins C, Gall A, Giron CG, Gil L, Gordon L, Haggerty L, Haskell E, Hourlier T, Izuogu OG, Janacek SH, Juettemann T, To JK, Laird MR, Lavidas I, Liu Z, Loveland JE, Maurel T, McLaren W, Moore B, Mudge J, Murphy DN, Newman V, Nuhn M, Ogeh D, Ong CK, Parker A, Patricio M, Riat HS, Schuilenburg H, Sheppard D, Sparrow H, Taylor K, Thormann A, Vullo A, Walts B, Zadissa A, Frankish A, Hunt SE, Kostadima M, Langridge N, Martin FJ, Muffato M, Perry E, Ruffier M, Staines DM, Trevanion SJ, Aken BL, Cunningham F, Yates A, Flicek P. Ensembl 2018. Nucleic Acids Res. 2018; 46(D1):754–61.

    Article  CAS  Google Scholar 

  39. Wiehe T, Gebauer-Jung S, Mitchell-Olds T, Guigó R. Sgp-1: Prediction and validation of homologous genes based on sequence alignments. Genome Res. 2001; 11(9):1574.

    Article  CAS  PubMed  PubMed Central  Google Scholar 

  40. Birney E, Durbin R. Using genewise in the drosophila annotation experiment. Genome Res. 2000; 10(4):547–8.

    Article  CAS  PubMed  PubMed Central  Google Scholar 

  41. Richmond T. Gene recognition via spliced alignment. Genome Biol. 2000; 1(1):1–4.

    Google Scholar 

  42. Birney E, Durbin R. Dynamite: A flexible code generating language for dynamic programming methods used in sequence comparison. In: International Conference on Intelligent Systems for Molecular Biology. Menlo Park: The AAAI Press: 1997. p. 56–64.

    Google Scholar 

  43. Sze SH, Pevzner PA. Las vegas algorithms for gene recognition: suboptimal and error-tolerant spliced alignment. J Comput Biol. 1997; 4(3):297–309.

    Article  CAS  PubMed  Google Scholar 

  44. Armean IM, Lilley KS, Trotter M, Pilkington N, Holden SB. Co-complex protein membership evaluation using maximum entropy on go ontology and interpro annotation. Bioinformatics. 2018; 34(11):1884–92.

    Article  CAS  PubMed  PubMed Central  Google Scholar 

  45. Liu ZP, Gao R. Detecting pathway biomarkers of diabetic progression with differential entropy. J Biomed Inform. 2018; 82:143–53.

    Article  PubMed  Google Scholar 

  46. Tao Y, Sam L, Li J, Friedman C, Lussier YA. Information theory applied to the sparse gene ontology annotation network to predict novel gene function. Bioinformatics. 2007; 23(13):529–38.

    Article  CAS  Google Scholar 

Download references


This work and publication costs are funded by the grants from the National “863” Key Basic Research Development Program (2014AA021505), Key research and development plan of the Ministry of science and technology (2017YFSF120182) and the start-up grant of Harbin Institute of Technology (Shenzhen).

Availability of data and materials

The AJ229040 gene data set analyzed during the current study is available in the NCBI Database [37]:

The 15 gene data sets from five species in current study are available in the Ensemble Database [38]:

The main source code to calculate modified generalized topological entropy and digitalize a DNA sequence is available at:

About this supplement

This article has been published as part of BMC Bioinformatics Volume 20 Supplement 8, 2019: Decipher computational analytics in digital health and precision medicine. The full contents of the supplement are available online at

Author information

Authors and Affiliations



JL and LZ designed the study, performed bioinformatics analysis and drafted the manuscript. HL, YP, QZX and RJW participated in entropy relevance studies. RJT, ZW and BL participated in the design of the study. JL and YDW conceived of the study, participated in its design and coordination and helped to draft the manuscript. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Yadong Wang.

Ethics declarations

Ethics approval and consent to participate

Not applicable.

Consent for publication

Not applicable.

Competing interests

The authors declare that they have no competing interests.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Additional file

Additional file 1

Figure S1. The AUC value of ROC curves from exon prediction results of 15 genes.(a) – (e) The performance obtained by our method for every specie and the value of AUC ranges from 0.55 to 0.81. Table S1. Significance level of p-value in Kruskal-Wallis Test for generalized topological entropy and modified generalized topological entropy calculation of genetic elements. Table S2. Prediction of exon and intron regions on single gene AJ229040. Table S3. Prediction of exon and intron regions on genes across five species. (DOCX 17, 765 kb)

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver ( applies to the data made available in this article, unless otherwise stated.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, J., Zhang, L., Li, H. et al. Integrated entropy-based approach for analyzing exons and introns in DNA sequences. BMC Bioinformatics 20 (Suppl 8), 283 (2019).

Download citation

  • Published:

  • DOI: