Biological Systems: Open Access

Similar documents
Computational Biology: Basics & Interesting Problems

Introduction to Bioinformatics

INTERACTIVE CLUSTERING FOR EXPLORATION OF GENOMIC DATA

Small RNA in rice genome

Computational methods for the analysis of bacterial gene regulation Brouwer, Rutger Wubbe Willem

STAAR Biology Assessment

BSc MATHEMATICAL SCIENCE

Computational Structural Bioinformatics

86 Part 4 SUMMARY INTRODUCTION

Bioinformatics Chapter 1. Introduction

Computational Genomics. Systems biology. Putting it together: Data integration using graphical models

Clustering and Network

Descriptors of 2D-dynamic graphs as a classification tool of DNA sequences

6.047 / Computational Biology: Genomes, Networks, Evolution Fall 2008

Learning in Bayesian Networks

Biology Assessment. Eligible Texas Essential Knowledge and Skills

COMPETENCY GOAL 1: The learner will develop abilities necessary to do and understand scientific inquiry.

Hiromi Nishida. 1. Introduction. 2. Materials and Methods

Proteomics. 2 nd semester, Department of Biotechnology and Bioinformatics Laboratory of Nano-Biotechnology and Artificial Bioengineering

Analysis and visualization of protein-protein interactions. Olga Vitek Assistant Professor Statistics and Computer Science

Gibbs Sampling Methods for Multiple Sequence Alignment

1. CHEMISTRY OF LIFE. Tutorial Outline

Protein function studies: history, current status and future trends

10-810: Advanced Algorithms and Models for Computational Biology. microrna and Whole Genome Comparison

DESIGNING CNN GENES. Received January 23, 2003; Revised April 2, 2003

Computational methods for predicting protein-protein interactions

Sequence Alignment Techniques and Their Uses

Introduction Biology before Systems Biology: Reductionism Reduce the study from the whole organism to inner most details like protein or the DNA.

Statistical Machine Learning Methods for Bioinformatics II. Hidden Markov Model for Biological Sequences

BME 5742 Biosystems Modeling and Control

Genome 541 Introduction to Computational Molecular Biology. Max Libbrecht

October 08-11, Co-Organizer Dr. S D Samantaray Professor & Head,

Improved TBL algorithm for learning context-free grammar

Unit of Study: Genetics, Evolution and Classification

Cellular Automata Evolution for Pattern Recognition

Understanding Science Through the Lens of Computation. Richard M. Karp Nov. 3, 2007

Model Accuracy Measures

Hidden Markov Models and some applications

11/24/13. Science, then, and now. Computational Structural Bioinformatics. Learning curve. ECS129 Instructor: Patrice Koehl

Identifying Signaling Pathways

Dynamical Modeling in Biology: a semiotic perspective. Junior Barrera BIOINFO-USP

Approximate inference for stochastic dynamics in large biological networks

Introduction to Hidden Markov Models for Gene Prediction ECE-S690

Miller & Levine Biology 2014

What is Systems Biology

Chapter 2 Class Notes Words and Probability

Lowndes County Biology II Pacing Guide Approximate

Map of AP-Aligned Bio-Rad Kits with Learning Objectives

Course Descriptions Biology

Data Mining in Bioinformatics HMM

AP Curriculum Framework with Learning Objectives

biologically-inspired computing lecture 18

O 3 O 4 O 5. q 3. q 4. Transition

Artificial Neural Network Method of Rock Mass Blastability Classification

Course plan Academic Year Qualification MSc on Bioinformatics for Health Sciences. Subject name: Computational Systems Biology Code: 30180

Prokaryotic Gene Expression (Learning Objectives)

C.-A. Azencott, M. A. Kayala, and P. Baldi. Institute for Genomics and Bioinformatics Donald Bren School of Information and Computer Sciences

Cell biology traditionally identifies proteins based on their individual actions as catalysts, signaling

Lamar University College of Arts and Sciences. Hayes Building Phone: Office Hours: T 2:15-4:00 R 2:15-4:00

STRUCTURAL BIOINFORMATICS I. Fall 2015

How much non-coding DNA do eukaryotes require?

Molecular Biology - Translation of RNA to make Protein *

The Role of Network Science in Biology and Medicine. Tiffany J. Callahan Computational Bioscience Program Hunter/Kahn Labs

Algorithm for Coding DNA Sequences into Spectrum-like and Zigzag Representations

Bioinformatics. Dept. of Computational Biology & Bioinformatics

Updated: 10/11/2018 Page 1 of 5

Visually Identifying Potential Domains for Change Points in Generalized Bernoulli Processes: an Application to DNA Segmental Analysis

Deep Learning Srihari. Deep Belief Nets. Sargur N. Srihari

Modeling Noise in Genetic Sequences

Hidden Markov Models and some applications

AP Bio Module 16: Bacterial Genetics and Operons, Student Learning Guide

Total

von Neumann Architecture

BIOINFORMATICS LAB AP BIOLOGY

An overview of deep learning methods for genomics

Genomes and Their Evolution

Classification of Ordinal Data Using Neural Networks

GOVERNMENT GIS BUILDING BASED ON THE THEORY OF INFORMATION ARCHITECTURE

Big Idea 1: The process of evolution drives the diversity and unity of life.

Comparing transcription factor regulatory networks of human cell types. The Protein Network Workshop June 8 12, 2015


A New Method to Build Gene Regulation Network Based on Fuzzy Hierarchical Clustering Methods

Network Biology: Understanding the cell s functional organization. Albert-László Barabási Zoltán N. Oltvai

The genome encodes biology as patterns or motifs. We search the genome for biologically important patterns.

SYSTEM EVALUATION AND DESCRIPTION USING ABSTRACT RELATION TYPES (ART)

Biological Networks: Comparison, Conservation, and Evolution via Relative Description Length By: Tamir Tuller & Benny Chor

Deleting a marked state in quantum database in a duality computing mode

Unit 2: ECE/AP Biology Cell Biology 12 class meetings. Essential Questions. Enduring Understanding with Unit Goals

COURSE CONTENT for Computer Science & Engineering [CSE]

Field 045: Science Life Science Assessment Blueprint

Multiple Choice Review- Eukaryotic Gene Expression

Discovering molecular pathways from protein interaction and ge

MATHEMATICAL MODELS - Vol. III - Mathematical Modeling and the Human Genome - Hilary S. Booth MATHEMATICAL MODELING AND THE HUMAN GENOME

Big Idea 3: Living systems store, retrieve, transmit, and respond to information essential to life processes.

APPENDIX II. Laboratory Techniques in AEM. Microbial Ecology & Metabolism Principles of Toxicology. Microbial Physiology and Genetics II

15.2 Prokaryotic Transcription *

Grade Level: AP Biology may be taken in grades 11 or 12.

Algorithms in Computational Biology (236522) spring 2008 Lecture #1

A Repetitive Corpus Testbed

Combining Sum-Product Network and Noisy-Or Model for Ontology Matching

Transcription:

Biological Systems: Open Access Biological Systems: Open Access Liu and Zheng, 2016, 5:1 http://dx.doi.org/10.4172/2329-6577.1000153 ISSN: 2329-6577 Research Article ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species Yuquan Liu 1 and Jeffrey Zheng 2,3 * 1 School of Software and Microelectronics, Peking University, Beijing, China 2 Key Lab of Yunnan Software Engineering, Kunming, China 3 School of Software, Yunnan University, Kunming, China Open Access Abstract DNA sequences comprise complex genetic information, their specific characteristics are contained in both coding and non-coding sequences. Major gene components in higher levels of organisms are composed of non-coding sequences. In ENCODE project, there are evidence that 98% human Genomes are non-coding forms and 80% of them with functions. This paper provides a measurement model and a set of experiment results on genomic sequences using variant maps to distinguish differences on coding and non-coding sequences in visual representations. This model applies probability measurements on DNA sequences to coding and non-coding regions respectively to identify distinguished patterns from different sequences of multiple species. Keywords: Non-coding sequence; ariant map, Representation technique; Probability measurement Introduction The results of the Human Genome Project HGP show that 98% human genomes are non-coding DNAs [1]. From a biochemically functional viewpoint [2,3], over 80% of DNA in the human genome serves some purpose. To popular belief, non-coding DNAs affect regulation of gene expression, so these are composed of the most important parts of bioinformatics to getting characteristics of noncoding DNAs as well as regulation and expression [4]. With massive genetic information obtained from advanced genome projects over the worldwide DNA databases as genetic data banks, it is a primary task to analyze and get biological information in the postgenomic era [5]. As a genetic language, a DNA sequence is not only reflected in a sequence of a coding region, but also it could be contained in a sequence of a non-coding region [6]. Gene coding region is the region where the DNA sequence could be translated into a sequence of proteins (i.e., gene). In recent studies of complete genome, there are evidences that DNA sequences of coding and non-coding have significant differences among different organisms. For example, noncoding regions only account for 10% to 20% in the entire genome sequences for bacteria [7]. While non-coding regions of organisms and human represent the vast majority in their genomic sequences. Noncoding DNA/RNA may be the drive of degree of biological complexity with great heterogeneity. The analysis for non-coding DNA/RNA sequence is to analyze biological information expressed by sequential structures and functions [8] with rich research contents. In current R&D environments, various analytic technologies are used including frequency distribution, GC density, machine learning, Bayesian inference, neural networks, and hidden Markov models etc. Different graphical representations recently developed are powerful visualization tools applied in the analysis of non-coding DNA/RNA sequences. They can be applied to reveal biological information embedded in structures and functions of a non-coding DNA/RNA sequence. arious visual analysis tools play an important role in the HGP [9]. Encountered with massive non-coding DNA/RNA data, conventional analytic methods could not satisfy advanced R&D requirements. Compared with traditional approaches, graphical representation technologies can make complementary assistance visually and effectively characterize analysis results of non-coding DNA/RNA sequences. isual representation technologies provide useful tools to analyze complex non-coding DNA/RNA sequences [10]. In the HGP, graphical representation has been successfully applied to analyze DNA sequences and to get relevant DNA profiles. However, this type of visualization models in human genome does not apply to noncoding DNA/RNA in analysis with significant advantages. We present an advanced approach variant map based on mathematical and statistical principles to process non-coding DNA/ RNA data in measuring forms, to illustrate visualization results on noncoding regions of genes distributed in different species. System architecture In this section, system architecture and their core components of variant map system are discussed with the use of diagrams. The refined definitions and equations of this system are described. Architecture: The Architecture of variant map system is composed of three components: ariant Measurement, Coordinate Map, and Graphical projection shown in Figure 1. Each component is composed of one to three modules respectively discussed in the next subsection. Under this architecture, the component of ariant Measurement ariant Measurement M, Coordinate Map CM, Graphical Projection GP Figure 1: Architecture of variant map system. *Corresponding author: Jeffrey Zheng, Professor, Yunnan University, Information Security, China, Tel: +8613108839090; E-mail: conjugatelogic@yahoo.com Received December 18, 2015; Accepted January 20, 2016; Published January 28, 2016 Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Syst Open Access 5: 153. doi:10.4172/2329-6577.1000153 Copyright: 2016 Liu Y, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Page 2 of 10 M processes a selected DNA sequence with N elements as an input. Multiple segments can be partitioned into multiple segments and each segment composed of a fixed number of n elements. The output of the M is composed of four vectors of probability measurement. The four vectors and a given k value are input data for the component of Coordinate Map CM, the output of the CM is a pair of position values created from input parameters. The pair of positions is an input parameter for the component of Graphical Projection GP to determine a projected position to be a visual point. After all elements of selected DNA sequences processed, multiple segments are transformed as a set of pair values to generate relevant graphs to indicate their distribution properties on 2D maps respectively. Core modules The M component: The M component is composed of three modules: Probability Measurement, Histograms and Normalized Histograms shown in Figure 2. The output of the M component provides its output as the input of the CM component. Main I/O measures of the M component are in three groups (Input, Intermediate and Output): Input group: A selected DNA sequence Intermediate output/input Group: Probability Measurement: Four sets of probability measurements on {A,C,G,T} projection respectively Histograms: Histograms for relevant probability measurements Output group Normalized histograms: Normalized histograms for relevant probability measurements The M component: Four sets of probability measurements The preprocessed DNA data forms multiple segments in a selected DNA sequence. The number of elements in each segment determines the horizontal coordinates; superpose the same number of segments to generate a histogram. Corresponding four {A,C,G,T} projections, four normalized histograms are created from the M component. The values of each set of probability measurements are between 0 and 1, and the sum of each set is equal to 1. The CM component The CM component is shown as Figure 3 and its I/O parameters are listed as follows. Input group: Normalized Measurement: Four sets of probability measurements Selected DNA sequence Normalized Probability Measurement Measurement Histogram Normalized Histogram Figure 2: The Component of M. Parameter K Coordinate Map Figure 3: Coordinate Map. Normalized Measurement Four paired value K: An integer indicates the control parameter for mapping Output group: Four paired values This component takes probability measurements as input, using a control parameter k to generate relevant histogram and its normalized distribution. The output of this part is composed of four paired values in a given condition. The GP component The GP component is shown in Figure 4 and its I/O parameters are listed as follows. Input Group: All selected DNA sequence Four paired values Output Group: Four 2D maps. This part uses four paired values to repeat process rest segments in the selected DNA sequence. The output of this component provides four 2D maps as final output. Detailed description Section 2 provides system description on the ariant Map System, it is necessary to make further explanation for its further details in this section. Parameter description n an integer the number of elements in a segment, n>0 a symbol selected from four DNA symbols, {A,G,T,C} = D, ϵ D K: An integer the control parameter for mapping m t : The t-th segments N X j : N j length in a j-th DNA sequencene N j Four paired value (,,,,,.. N 1 1 2 3 4...,..., 1 ), { j k N j k,,, } X = X, X X X X X X X AGT C 0 k N j,0 < j < M, {(<j <M)} M: an integer, the total number of involved DNA sequences {( k k, )} X Y : Four paired values, k>0, ϵ D, {A, G, T, C} = D T : Four sets of probability measurements i {H ( T i )} Four histograms for relevant probability measurements, ϵ D, {A, G, T, C} = D { P H ( T )} i measurements, { P H ( i )} ariant measurement Four normalized histograms for relevant probability Ti t T = 0 All selected DNA sequence Graphical Projection Figure 4: Graphical projection. i, T ϵ D, {A, G, T, C} = D 2D map Multiple segments are partitioned by a fixed number of n elements for each segment from a selected DNA sequence length N, as the i-th packet. The number of each elements contained in a segment can be expressed as T i.

Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Page 3 of 10 T + T + T + T, { T } A T C G t 1 i i i i i i= 0 Counting this type of measures, a histogram can be created as H (Ti v ) satisfied the following condition: H ( T ) = 1, 0 n i T i Collecting all possible values, a histogram distribution can be established H ( t 1 T i ) = H ( T i ) i= 0 Under this construction, a normalized histogram can be defined as P H ( T A T C G n i ) v ={ Tl, Tl, Tl, Tl } l= 0, Tl [ 01,] n v Tl = 1 l= 0 Coordinate map Using this set of measurements, projective functions can be established to calculate a pair of values to analyze a DNA sequence into 2D map as follows: 1 Let y 1 = F (P,, k), x1 = F( P,, ), k { k k xv, y } that will be a pair of values defined by following equations: n k v k k y1 = yv = F( P,, k) = ( pl ) l= 0 n k v k x1 = x (,,1/ ) k v = F P k = ( pl ) Then each pair of values locates a specific position on a 2D map for the selected DNA sequence. Graphical projection Each selected DNA sequence generates a specific position on a 2D l= 0 map; it is essential to generate all selected sequence using graphical projection. N Each segment j X can get a specific position; the j-th position can be projected. Similar operations are repeated on other sequences and each sequence corresponding to a projective point on the 2D map. Consequently this part makes all processed measurements as their projective positions, and finally to generate four 2D maps for selected DNA sequences respectively. Applying this system, coding and non-coding DNA sequences of genomes are selected from Multiple Species, and then eight groups of relevant variant maps are generated for each selected type of species. Results of variant maps It is always difficult to imagine map effects from control parameters in equations. A list of controlled effects will be illustrated in this section. Let readers easier understand different visual effects via different results of variant maps under various controlled parameters. Sample results of variant maps on different parameters Using coding and non-coding DNA sequences, under different conditions to illustrate their spatial distributions in a controllable environment. Group results under different k are shown in Figure 5. In Figure 5, six 2D maps are illustrated in the range of k = 2-7, N = 500, n = 10 for comparison, it seems that at k=4, map (e) provides a better distribution effect. A set of results generated by various n is illustrated in Figure 6. In Figure 6, six 2D maps are selected in the range of k = 4, N=500, n (a) k = 2 (b) k = 3 (c) k = 4 (d) k = 5 (e) k = 6 (f) k = 7 Figure 5: ariant maps on different k values; (a-f) k ={2,3,4,5,6,7}; N = 500, n = 10.

Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Page 4 of 10 = {5,10,15,20,25,30} conditions respectively. Map (b) may show a better distribution at n = 10. In Figure 7, different maps are illustrated under n = 5 and k in different values. (a) n = 5 (b) n = 10 (c) n = 15 (d) n = 20 (e) n = 25 (f) n = 30 Figure 6: ariant Maps on different n; (a-f) n={5,10,15,20,25,30}, N=500, n=10. K = 2 K = 3 K = 4 K = 5 K = 6 K = 7 Figure 7: ariant maps on n=5 in different k values.

Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Page 5 of 10 In Figure 7, six 2D maps are selected in condition on k = 2-7, N = 500, n = 5. Six maps do not have significant difference. By the reason, we select n=10 in further processes. ariant maps on multiple species Four species of DNA data sources are selected from worldwide public gene banks: Salmonella, Caenorhabditis Elegans, Oryza and Pan troglodytes. A list of results will be shown in Figures 8-12 under different DNA data sequences and different control conditions. In Figure 8, eight variant maps of Salmonella are listed under the (a) (b) (c) (d) (e) (f) (g) (h) Figure 8: The ariant Maps of Salmonella; (a)-(d) coding results on (a) Map A, (b) Map T, (c) Map C, (d) Map G ; (e)-(h) non-coding results on (e) Map A, (f) Map T, (g) Map C, (h) Map G respectively.

Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Page 6 of 10 (a) (b) (c) (d) (e) (f) (g) (h) Figure 9: The variant maps of Caenorhabditis Elegans; (a)-(d) coding results on (a) Map A, (b) Map T, (c) Map C, (d) Map G ; (e)-(h) non-coding results on (e) Map A, (f) Map T, (g) Map C, (h) Map G respectively.

Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Page 7 of 10 (a) (b) (c) (d) (e) (f) (c) (d) Figure 10: The variant maps of Oryza; (a)-(d) coding results on (a) Map A, (b) Map T, (c) Map C, (d) Map G ; (e)-(h) non-coding results on (e) Map A, (f) Map T, (g) Map C, (h) Map G respectively.

Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Page 8 of 10 (a) (b) (c) (d) (e) (f) (g) (h) Figure 11: The variant maps of Pan Troglodytes; (a)-(d) coding results on (a) Map A, (b) Map T, (c) Map C, (d) Map G ; (e)-(h) non-coding results on (e) Map A, (f) Map T, (g) Map C, (h) Map G respectively.

Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Page 9 of 10 Salmonella Caenorhabditis Elegans Oryza Non-coding [A] Maps Pan troglodytes Salmonella Caenorhabditis Elegans Oryza Pan troglodytes Figure 12: Eight ariant Maps of four selected species on Map A in both coding and non-coding conditions respectively.

Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Non-coding DNA Sequences of Genomes Selected from Multiple Species. Biol Page 10 of 10 condition k=4, n=10, N=500. In which maps (a) (d) are shown the results of coding DNA on MapA, MapT, MapC, MapG respectively. Maps (e)-(h) are shown the results of non-coding DNA on MapA, MapT, MapC, MapG respectively. In Figure 9, eight variant maps of Caenorhabditis Elegans are listed under the condition k=4, n=10, N=500. In which maps (a)-(d) are shown the results of coding DNA on MapA, MapT, MapC, MapG respectively. Maps (e)-(h) are shown the result of non-coding DNA on MapA, MapT, MapC, MapG respectively. In Figure 10, eight variant maps of Oryza are listed under the condition k=4, n=10, N=500. In which Maps (a)-(d) are shown the results of coding DNA on MapA, MapT, MapC, MapG respectively. Maps (e)-(h) are shown the result of non-coding DNA on MapA, MapT, MapC, MapG respectively. In Figure 11, eight variant maps of Pan troglodytes are listed under the condition k=4, n=10, N=500. In which Maps (a)-(d) are shown the results of coding DNA on MapA, MapT, MapC, MapG respectively. Maps (e)-(h) are shown the result of non-coding DNA on MapA, MapT, MapC, MapG respectively. In Figure 12, eight variant maps are selected to show four variant maps of the four selected species on both coding and non-coding conditions especially on MapA selected under the condition k=4, n=10, N=500 respectively. Maps (a)-(d) are shown in coding cases and Maps (e)-(h) are shown in non-coding cases respectively. Result s Analysis In relation to 2D maps under different control parameters, 2D maps represent obviously different. At the region of n=10 and k=2-7, different distributions can be observed, k=4 maps may provide better separation effects shown in Figure 5. It is interesting to observe different maps when parameter n changed. A larger n value makes a tighter distribution and larger n value takes clusters more separations on maps. Both n=5 and 10 maps may provide significant separation effects shown in Figure 6. Six 2D maps are selected in the range of k=2-7, N=500, n=5 for comparison, they do not have significant differences shown in Figure 7. This indicates that smaller lengths of segment may not be good to illustrate the characteristics of the distribution. Systematic illustrations are listed in Figures 9-11. Each Figure contains eight maps in which four of them are coding maps and another four maps are non-coding ones. On all listed maps, we can see obvious visual pairs of symmetric relationships on A-T & G-C in both coding and non-coding maps. In general, a stronger similar distribution among G-C can be easier observed. We can observe that Caenorhabditis Elegans, Oryza and Pan Troglodytes maps provide much better separation effects than Salmonella. The regions of distributions on noncoding maps are shown in much larger than relevant distributions of coding maps. There are significant differences between coding and non-coding maps on Caenorhabditis Elegans, Oryza and Pan Troglodytes as distinct species, and their distributions of non-coding maps are with more substantial distinctions than coding maps. Non-coding maps of four species as shown in Figure 12, Pan Troglodytes maps are shown very richer distributions, Caenorhabditis Elegans, Oryza maps are followed with richer effects, and Salmonella has simpler effects. From the genetic viewpoint, the Pan troglodytes belongs to higher level of animals, this specie has more similar to human genes to a higher degree, Caenorhabditis Elegans and Oryza are also higher creatures, but Salmonella are belong to much lower rank than others. In a convenient comparison, Pan troglodytes maps show a richer distribution than other three. This set of results illustrates directly visual comparisons with significant differences between coding and non-coding DNA maps on different species in hierarchical organisms. Conclusion This paper proposes the variant map system to generate variant maps for four selected species. Using their selected DNA sequences respectively, this system uses variant measures, coordinate map and normalized histogram, to transform selected DNA sequences into significant different maps and each DNA sequence generates four projective maps on {A, T, G, C} respectively. Using this type of multiple map schemes, it is convenient for Multiple Species to make relevant processing and comparison. Each selected DNA sequence can be distinguished by either coding or noncoding sequences. Their variant maps can be generated to illustrate their visual features to distinguish coding/non-coding cases. All listed species are contained very richer significant characteristics in their variant maps. This system can provide further usages to handle further R&D activities in coding and non-coding DNA/RNA sequences. Acknowledgement Thanks to the school of software engineering Yunnan University and the key laboratory of Yunnan software engineering for financial supports to this project. References 1. Singh SK (2002) Responsibilities in the post genome era: are we prepared? Issues Med Ethics 10: 150-151. 2. Bernstein BE, Birney E, Dunham I (2012) An Integrated Encyclopedia of DNA Elements in the Human Genome. Nature 489: 57-74. 3. Pennisi E (2012) Genomics. ENCODE project writes eulogy for junk DNA. Science 337: 1159-1161. 4. Ecker JR, Bickmore WA, Barroso I, Pritchard JK, Gilad Y, et al. (2012) Genomics: ENCODE explained. Nature 489: 52-55. 5. Milan Randi, Marjana Novi, Dejan Plavsi (2013) Milestones in graphical bioinformatics. Int J Quantum Chem 113. 6. Staden R, McLachlan AD (1982) Codon preference and its use in identifying protein coding regions in long DNA sequences. Nucleic Acids Res 10: 141-156. 7. Michel CJ (1986) New statistical approach to discriminate between protein coding and non-coding regions in DNA sequences and its evaluation. J Theor Biol 120: 223-236. 8. Zheng J, Zhang W, Luo J, Zhou W, Shen R (2013) ariant Map System to Simulate Complex Properties of DNA Interactions Using Binary Sequences. Advances in Pure Mathematics 3: 5-24. 9. Zheng J, Luo J, Zhou W (2014) Pseudo DNA Sequence Generation of Non- Coding Distributions Using ariant Maps on Cellular Automata. Applied Mathematics 5: 153-174. 10. Zheng J, Zhang W, Luo J, Zhou W, Liesaputra (2014) ariant Map Construction to Detect Symmetric Properties of Genomes on 2D Distributions. J Data Mining Genomics Proteomics 5: 150. Citation: Liu Y, Zheng J (2016) ariant Maps to Identify Coding and Noncoding DNA Sequences of Genomes Selected from Multiple Species. Biol Syst Open Access 5: 153. doi:10.4172/2329-6577.1000153