SlideShare una empresa de Scribd logo
1 de 4
Descargar para leer sin conexión
Prakash Kumar Sarangi et al. / International Journal of Engineering Science and Technology (IJEST)



       A Compression- Based Technique for
       Comparing Stock Market Patterns Be-
          havior with Human Genome
                                            Prakash Kumar Sarangi
                                     Department of Information Technology
                        NM Institute of Engineering and Technology, Bhubaneswar, India.
                                        Prakash_sarangi89@yahoo.com.

                                             Birendra Kumar Nayak
                                           Department of Mathematic,
                                      Utkal University, Bhubaneswar, India.
                                             bknatuu@yahoo.co.uk.

                                              Sachidananda Dehuri
                                  Department of Information & Communication
                                   Fakir Mohan University, Balasore , India.
                                           Satchi.lapa@gmail.com.


Abstract
    In this paper we propose a new approach for comparing stock market patterns behavior with DNA
sequences using a compression based technique. The behavior of the stock market is put into sequence of 0’s
and 1’s which was converted to the sequence of nucleotides A, T, C, G. Here we propose a compression
algorithm “Huffman Coding “for DNA sequences based on a novel algorithm of assigning binary bit codes (0
and 1) for each base(A,C,G,T) to compress DNA sequence. This sequence so obtained is matched to the text
DNA sequence by using BLAST. It is found that the certain sub-sequences of the sequence match cent percent
with sub-sequences of Homo sapiens chromosome 19. Possibility using this approach to predict the stock
market behavior is explored.
Keywords: Huffman codes, Subsequence, Nucleotides, Local alignment.

1. INTRODUCTION
For many years the following question has been a source of continuing controversy in both academic and
business circles: To what extent can the past history of a common stock's price be used to make meaningful
predictions concerning the future price of the stock? Answers to this question have been provided on the one
hand by the various chartist theories and on the other hand by the theory of random walks. Although there are
many different chartist theories, they all make the same basic assumption. That is, they all assume that the past
behavior of a security's price is rich in information concerning its future behavior. History repeats itself in that
"patterns" of past price behavior will tend to recur in the future. Thus, if through careful analysis of price charts
one develops an understanding of these "patterns," this can be used to predict the future behavior of prices and
in this way increase expected gains [1].
      Due to its randomness, lots of research has going on for studying behavior of stock market. In 1959,
Roberts wrote” If the stock market behaved like a mechanically imperfect roulette wheel, people would notice
the imperfections and, by acting on them, remove them. This rationale is appealing, if for no other reason than
its value as counterweight to the popular view of stock market “irrationality,” but it is obviously incomplete.
Roberts generated a series of random numbers and plot result to see whether any patterns that were known to
technical analysts would be visible [2].
  In another way many work has been done using intelligent computational technique like Hidden Markov
Model (HMM), Artificial Neural Networks (ANN) and Genetic Algorithms (GA) to forecast financial market
behavior [3-5]. But in this paper we are putting a relationship between behaviors of stock market with DNA
sequences. For above analysis we need support of Bio-informatics tools like BLAST.
   The primary goal of bioinformatics is to increase the understanding of biological processes. Bioinformatics
[6], the application of computational techniques to analyze the information associated with bi-molecules on a
large scale, has now firmly established itself as a discipline in molecular biology. Bioinformatics is a
management information system for molecular biology. Bioinformatics encompasses everything from data
storage and retrieval to the identification and presentation of features within data, such as finding genes within


ISSN : 0975-5462                            Vol. 4 No.01 January 2012                                            144
Prakash Kumar Sarangi et al. / International Journal of Engineering Science and Technology (IJEST)


DNA sequence, finding similarities between sequences, structural predictions [7]. Using such BLAST software
we generate a relationship between them. Also we can predict future aspects of stock market.
    The main motivation of this paper is to propose a comparison between DNA sequences with stock market
tendency and to test the predictability of the proposed BLAST software. The rest of the study is organized as
follows. The next section will describe the methodology which processing in detail like mapping, encoding,
partitioning, and matching. In Section 3, we give an experiment scheme and Empirical results and analysis are
reported in this section. The concluding remarks are given in Section 4. In last Section we propose future work
for prediction of stock market.

2. METHODOLOGY
   In this section, the closing price of day to day trading builds a process is presented in detail mapping with
human genome. First of all, a mapping of stock price to binary is described. Then encode these binary values to
nucleotides using Huffman tree to compress total data to half. Nucleotides are divided in to several DNA
sequences having a continuous distribution. Each part matched using BLAST, which finally give a result as
establish a relation between human genome with stock market behavior.
2.1. Representation of Stock behavior to Binary
 This study is to map and explore the tendency of stock price index. The research data used in this study is
technical indicators and the direction of change in the daily S&P500 stock price index thirty years. Considering
their closing price of each day, they are categorized as “0” and “1” in the research data. “0” means that the next
day’s index is lower or same to today’s index, and “1” means that the next day’s index is higher than today’s
index [8].

2.2. Proposed Huffman Algorithm for Encoding
DNA, or deoxyribonucleic acid, is the hereditary material in humans and almost all other organisms. An
important property of DNA is that it can replicate, or make copies of itself. Each strand of DNA in the double
helix can serve as a pattern for duplicating the sequence of bases. This is critical when cells divide because each
new cell needs to have an exact copy of the DNA present in the old cell [9]. The information in DNA is stored
as a code made up of four chemical bases: adenine (A), guanine (G), cytosine (C), and thymine (T). DNA bases
pair up with each other, A with T and C with G, to form units called base pairs.
     The specific bit sequence assigned to an individual base is determined by tracing out the path from the root
of the Huffman tree to the leaf that represents that Base. By convention, bit '0' represents following the left child
when tracing out the path and bit '1' represents following the right child when tracing out the path. The Huffman
tree is constructed such that the paths from the root to the most frequently used bases are short while the paths to
less frequently used bases are long. This results in short codes for frequently used bases and long codes for less
frequently used bases. Now here we found that all are having same length so it is consider as fixed length
encoding process. If the sequences are encoded using the trivial method of assigning 2 bits per base. Given a
DNA sequence consisting of A, C, T, G characters, we use two bits to encode each character:
      “00” for A,
      “01” for C,
      “11” for T, and
      “10” for G.
   As a result, each cell of 2 bits representing one DNA character. As we know in DNA chaining “A” bonding
with “T” and “ C” bonding with “G” , we generate a rule which pairs are 1’s complement with each other [10].
For an example, DNA sequence TACCTGCGCTA is encoded by binary sequence 11 00 01 01 11 10 01 10 01
11 00.

2.3. Building of DNA Patterns

Entire compressed DNA pattern of thirty years are divided into six parts; each part corresponds to five years of
stock market behavior. Since each parts are a form of DNA sequence, we can say each part have a life. Now we
compare with a very large DNA database to identify this pattern behavior align with any species. There are
many pattern matching algorithms to match pattern of any data, but in bioinformatics we have very user friendly
tool BLAST, which have potential to find different patterns.
2.4. Multiple Sequence Alignment using BLAST
BLAST (Basic Local Alignment Search Tool): family of sequence alignment algorithms developed by Altschul
et. al. 1997. These programs are used for sequence similarity identification [7]. They identify regions of local
alignment to assist in detecting relationships among sequences, which allows the user to identify similarities
between the query nucleotide or protein sequence with sequences in public databases, Identifies clusters of
nearby or locally dense "similar" k-tuples (number of string of letters), Used to identify whether a given



ISSN : 0975-5462                            Vol. 4 No.01 January 2012                                            145
Prakash Kumar Sarangi et al. / International Journal of Engineering Science and Technology (IJEST)


sequence is novel, homologous to a known sequence, or if the sequence contains motifs which may provide
clues to a possible roles of the sequence being queried [7].
       The preferred query sequence format for the BLAST program is the FASTA format which, take input as
DNA sequences. Advanced BLAST tolerates both spaces and numbers and is case insensitive. After some time
it produce format having a Request ID number, E value, max sore, percentage of identified, also species name.

  Now each part of patterns are align with the large DNA database of BLAST. It is found that thirty years stock
patterns behavior perform a regular match with species like human being in each individual pattern matching.
Each sub-sequences of stock market cent percent match with Homo sapiens chromosome 19.

3. EXPERIMENTAL RESULTS
        The entire data set contains close price of S&P500 of thirty years which, covers the period from first
trading day of January, 1980 to last trading day of December, 2010. The data sets are divided into six periods
having five years each. The first period covers from January, 1980 to January, 1985, the second period is from
January, 1985 to January, 1990, third period is from January, 1990 to January, 1995, fourth period is from
January 1995 to January 2000, fifth period is from January, 2000 to January, 2005 and sixth period is from
January 2005 to December, 2010.
   Using BLAST we found that each part of DNA is cent percent match with DNA of Homo sapiens
chromosome 19 having gap zero percent. Homo sapiens chromosome 19 genomic contains 15894584 of
nucleotides. Above six part are pattern match with such nucleotides uniformly cent percent. Also if will divide
entire data set to three parts, the first period is from January, 1980 to January, 1990, the second period is from
January, 1990 to January, 2000 and third period is from January, 2000 to December, 2010. Using same
technique, we found highly similar identification with same species. From experimental results following table-
1 represents entire report of the year 1980 to 2010 comparing between each five years. Similarly table -2
represents comparison result of both DNA patterns in each decade start from 1980 to 2010.
                                  Table-1, maximum identification during each five years

                             Year duration         DNA           Max.         Max. Identi-
                                                   length        Score        fied

                             1980-1985             632           39.2         100%

                             1985-1990             631           39.2         100%

                             1990-1995             632           39.2         100%

                             1995-2000             627           39.2         100%

                             2000-2005             639           39.2         100%

                             2005-2010             640           39.2         100%

                                  Table-2, maximum identification during each ten years

                            Year duration          DNA           Max.         Max. Identi-
                                                   length        Score        fied

                            1980-1990              1263          39.2         100%

                            1990-2000              1259          39.2         100%

                            2000-2010              1279          39.2         100%

4. CONCLUSION & FUTURE WORK

   This study proposes using bioinformatics tool BLAST that perform a relationship between stock market
behaviors with DNA sequences. In terms of the empirical results, we find that each five years or each decade the
stock market tendency behaves like human DNA sequence. The alignment score says that between them
maximum identification is cent percent in each part. But for prediction purpose it is possible when continuous



ISSN : 0975-5462                             Vol. 4 No.01 January 2012                                        146
Prakash Kumar Sarangi et al. / International Journal of Engineering Science and Technology (IJEST)


matching occurs. From experimental work we found that maximum identification not exactly equal to 100% in
each 15 years.
   As we found from above experiment each five years stock data are pattern matched with human genome.
Also stock market is fully random, for prediction of stock price possible for next five years. This is the future
work to predict behavior of stock market for coming trading days.

5. REFERENCES

[1]  Hasan, A.; Saleem, HM.; Abdullah, S.; “Long- Run Relationships between an Emerging Equity Market and        Equity Markets of the
     Developed World an Empirical Analysis of Karachi Stock Exchange,” International Research Journal of Finance and Economics,
     2008, 16, pp.52-62.
[2] Robert, H.; “Stock Market ‘Patterns’ and Financial Analysis, Journal of Finance , 1959
[3] Kamijo, K.; Tanigawa, T.; Stock Price Pattern Recognition: A Recurrent Neural Network Approach, In            Proceedings of the
     International Joint Conference on Neural Networks, San Diego, CA (1990) 215-221.
[4] Tsaih, R.; Hsu, Y.; Lai, C.C.; Forecasting S&P 500 Index Futures with a Hybrid AI system. Decision Support     Systems 23 (1998)
     161-174.
[5] Hassan, M.R.; Nath, B.; Kirley. M.; A fusion model of HMM, ANN and GA for stock market forecasting, Expert Systems with
     Applications 33 (2007) 171–180.
[6] Li, F.; Stormo, D. G.; Selection of optimal DNA oligos for gene expression arrays. Bioinformatics, 17: 1067-
[7] 1076, http://bioinformatics.oxfordjournals.org/cgi/content /abstract/17/11/1067.
[8] http://www.ncbi.nlm.nih.gov/BLAST.
[9] Yu, L.; Wang, S.; Lai, K. K.; Mining Stock Market Tendency Using GA-Based Support Vector Machines, WINE 2005, LNCS 3828,
     pp. 336 – 345, 2005.
[10] Karp, R.; Rabin, M.; An efficient randomized pattern-matching algorithms, IBM Journal of Research and              Development,
     31(2):249–260, 1987.
[11] Rajarajeswari, p.; Apparao, A.; Kiran, K. R.; Huffbit Compress – Algorithm to Compress DNA Sequences Using Extended Binary
     Trees, Journal of Theoretical and Applied Information Technology, 2005.




ISSN : 0975-5462                                  Vol. 4 No.01 January 2012                                                      147

Más contenido relacionado

La actualidad más candente

Analysis of Opinionated Text for Opinion Mining
Analysis of Opinionated Text for Opinion MiningAnalysis of Opinionated Text for Opinion Mining
Analysis of Opinionated Text for Opinion Miningmlaij
 
AUTOMATED INFORMATION RETRIEVAL MODEL USING FP GROWTH BASED FUZZY PARTICLE SW...
AUTOMATED INFORMATION RETRIEVAL MODEL USING FP GROWTH BASED FUZZY PARTICLE SW...AUTOMATED INFORMATION RETRIEVAL MODEL USING FP GROWTH BASED FUZZY PARTICLE SW...
AUTOMATED INFORMATION RETRIEVAL MODEL USING FP GROWTH BASED FUZZY PARTICLE SW...ijcseit
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)IJERD Editor
 
Comparison of relational and attribute-IEEE-1999-published ...
Comparison of relational and attribute-IEEE-1999-published ...Comparison of relational and attribute-IEEE-1999-published ...
Comparison of relational and attribute-IEEE-1999-published ...butest
 
Blei ngjordan2003
Blei ngjordan2003Blei ngjordan2003
Blei ngjordan2003Ajay Ohri
 
Bioinformatics_Sequence Analysis
Bioinformatics_Sequence AnalysisBioinformatics_Sequence Analysis
Bioinformatics_Sequence AnalysisSangeeta Das
 
Performance analysis of linkage learning techniques
Performance analysis of linkage learning techniquesPerformance analysis of linkage learning techniques
Performance analysis of linkage learning techniqueseSAT Publishing House
 
Performance analysis of linkage learning techniques in genetic algorithms
Performance analysis of linkage learning techniques in genetic algorithmsPerformance analysis of linkage learning techniques in genetic algorithms
Performance analysis of linkage learning techniques in genetic algorithmseSAT Journals
 
A rough set based hybrid method to text categorization
A rough set based hybrid method to text categorizationA rough set based hybrid method to text categorization
A rough set based hybrid method to text categorizationNinad Samel
 
Bioinformatics data mining
Bioinformatics data miningBioinformatics data mining
Bioinformatics data miningSangeeta Das
 
IRJET - Deep Collaborrative Filtering with Aspect Information
IRJET - Deep Collaborrative Filtering with Aspect InformationIRJET - Deep Collaborrative Filtering with Aspect Information
IRJET - Deep Collaborrative Filtering with Aspect InformationIRJET Journal
 
Delroy Cameron's Dissertation Defense: A Contenxt-Driven Subgraph Model for L...
Delroy Cameron's Dissertation Defense: A Contenxt-Driven Subgraph Model for L...Delroy Cameron's Dissertation Defense: A Contenxt-Driven Subgraph Model for L...
Delroy Cameron's Dissertation Defense: A Contenxt-Driven Subgraph Model for L...Amit Sheth
 
International Journal of Computer Science, Engineering and Information Techno...
International Journal of Computer Science, Engineering and Information Techno...International Journal of Computer Science, Engineering and Information Techno...
International Journal of Computer Science, Engineering and Information Techno...IJCSEIT Journal
 
ONTOLOGICAL TREE GENERATION FOR ENHANCED INFORMATION RETRIEVAL
ONTOLOGICAL TREE GENERATION FOR ENHANCED INFORMATION RETRIEVALONTOLOGICAL TREE GENERATION FOR ENHANCED INFORMATION RETRIEVAL
ONTOLOGICAL TREE GENERATION FOR ENHANCED INFORMATION RETRIEVALijaia
 
Dr31564567
Dr31564567Dr31564567
Dr31564567IJMER
 
A NAIVE METHOD FOR ONTOLOGY CONSTRUCTION
A NAIVE METHOD FOR ONTOLOGY CONSTRUCTIONA NAIVE METHOD FOR ONTOLOGY CONSTRUCTION
A NAIVE METHOD FOR ONTOLOGY CONSTRUCTIONijscai
 
Information extraction using discourse
Information extraction using discourseInformation extraction using discourse
Information extraction using discourseijitcs
 

La actualidad más candente (20)

Analysis of Opinionated Text for Opinion Mining
Analysis of Opinionated Text for Opinion MiningAnalysis of Opinionated Text for Opinion Mining
Analysis of Opinionated Text for Opinion Mining
 
AUTOMATED INFORMATION RETRIEVAL MODEL USING FP GROWTH BASED FUZZY PARTICLE SW...
AUTOMATED INFORMATION RETRIEVAL MODEL USING FP GROWTH BASED FUZZY PARTICLE SW...AUTOMATED INFORMATION RETRIEVAL MODEL USING FP GROWTH BASED FUZZY PARTICLE SW...
AUTOMATED INFORMATION RETRIEVAL MODEL USING FP GROWTH BASED FUZZY PARTICLE SW...
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)
 
Comparison of relational and attribute-IEEE-1999-published ...
Comparison of relational and attribute-IEEE-1999-published ...Comparison of relational and attribute-IEEE-1999-published ...
Comparison of relational and attribute-IEEE-1999-published ...
 
Blei ngjordan2003
Blei ngjordan2003Blei ngjordan2003
Blei ngjordan2003
 
[IJET-V1I6P17] Authors : Mrs.R.Kalpana, Mrs.P.Padmapriya
[IJET-V1I6P17] Authors : Mrs.R.Kalpana, Mrs.P.Padmapriya[IJET-V1I6P17] Authors : Mrs.R.Kalpana, Mrs.P.Padmapriya
[IJET-V1I6P17] Authors : Mrs.R.Kalpana, Mrs.P.Padmapriya
 
Bioinformatics_Sequence Analysis
Bioinformatics_Sequence AnalysisBioinformatics_Sequence Analysis
Bioinformatics_Sequence Analysis
 
Performance analysis of linkage learning techniques
Performance analysis of linkage learning techniquesPerformance analysis of linkage learning techniques
Performance analysis of linkage learning techniques
 
Performance analysis of linkage learning techniques in genetic algorithms
Performance analysis of linkage learning techniques in genetic algorithmsPerformance analysis of linkage learning techniques in genetic algorithms
Performance analysis of linkage learning techniques in genetic algorithms
 
A rough set based hybrid method to text categorization
A rough set based hybrid method to text categorizationA rough set based hybrid method to text categorization
A rough set based hybrid method to text categorization
 
Bioinformatics data mining
Bioinformatics data miningBioinformatics data mining
Bioinformatics data mining
 
A4 elanjceziyan
A4 elanjceziyanA4 elanjceziyan
A4 elanjceziyan
 
IRJET - Deep Collaborrative Filtering with Aspect Information
IRJET - Deep Collaborrative Filtering with Aspect InformationIRJET - Deep Collaborrative Filtering with Aspect Information
IRJET - Deep Collaborrative Filtering with Aspect Information
 
[IJET-V2I3P19] Authors: Priyanka Sharma
[IJET-V2I3P19] Authors: Priyanka Sharma[IJET-V2I3P19] Authors: Priyanka Sharma
[IJET-V2I3P19] Authors: Priyanka Sharma
 
Delroy Cameron's Dissertation Defense: A Contenxt-Driven Subgraph Model for L...
Delroy Cameron's Dissertation Defense: A Contenxt-Driven Subgraph Model for L...Delroy Cameron's Dissertation Defense: A Contenxt-Driven Subgraph Model for L...
Delroy Cameron's Dissertation Defense: A Contenxt-Driven Subgraph Model for L...
 
International Journal of Computer Science, Engineering and Information Techno...
International Journal of Computer Science, Engineering and Information Techno...International Journal of Computer Science, Engineering and Information Techno...
International Journal of Computer Science, Engineering and Information Techno...
 
ONTOLOGICAL TREE GENERATION FOR ENHANCED INFORMATION RETRIEVAL
ONTOLOGICAL TREE GENERATION FOR ENHANCED INFORMATION RETRIEVALONTOLOGICAL TREE GENERATION FOR ENHANCED INFORMATION RETRIEVAL
ONTOLOGICAL TREE GENERATION FOR ENHANCED INFORMATION RETRIEVAL
 
Dr31564567
Dr31564567Dr31564567
Dr31564567
 
A NAIVE METHOD FOR ONTOLOGY CONSTRUCTION
A NAIVE METHOD FOR ONTOLOGY CONSTRUCTIONA NAIVE METHOD FOR ONTOLOGY CONSTRUCTION
A NAIVE METHOD FOR ONTOLOGY CONSTRUCTION
 
Information extraction using discourse
Information extraction using discourseInformation extraction using discourse
Information extraction using discourse
 

Destacado

Destacado (7)

Facebook one hour tuition slideshare
Facebook one hour tuition slideshareFacebook one hour tuition slideshare
Facebook one hour tuition slideshare
 
First Do No Harm: Ethics and Online Representation
First Do No Harm: Ethics and Online RepresentationFirst Do No Harm: Ethics and Online Representation
First Do No Harm: Ethics and Online Representation
 
Pumping Up Disadvantaged Students
Pumping Up Disadvantaged StudentsPumping Up Disadvantaged Students
Pumping Up Disadvantaged Students
 
Deloitte Mobile Brochure
Deloitte Mobile BrochureDeloitte Mobile Brochure
Deloitte Mobile Brochure
 
Intersection between the activities of two regulators – shall prior actions t...
Intersection between the activities of two regulators – shall prior actions t...Intersection between the activities of two regulators – shall prior actions t...
Intersection between the activities of two regulators – shall prior actions t...
 
What is the #WVUCommMOOC?
What is the #WVUCommMOOC?What is the #WVUCommMOOC?
What is the #WVUCommMOOC?
 
EDF2014: Daniel Vila-Suero, Researcher, Ontology Engineering Group, Universid...
EDF2014: Daniel Vila-Suero, Researcher, Ontology Engineering Group, Universid...EDF2014: Daniel Vila-Suero, Researcher, Ontology Engineering Group, Universid...
EDF2014: Daniel Vila-Suero, Researcher, Ontology Engineering Group, Universid...
 

Similar a Stock markets and_human_genomics

Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...Sarvesh Kumar
 
Discover How Scientific Data is Used for the Public Good with Natural Languag...
Discover How Scientific Data is Used for the Public Good with Natural Languag...Discover How Scientific Data is Used for the Public Good with Natural Languag...
Discover How Scientific Data is Used for the Public Good with Natural Languag...BaoTramDuong2
 
Capital market applications of neural networks etc
Capital market applications of neural networks etcCapital market applications of neural networks etc
Capital market applications of neural networks etc23tino
 
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...journal ijrtem
 
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...IJRTEMJOURNAL
 
Application of Hybrid Genetic Algorithm Using Artificial Neural Network in Da...
Application of Hybrid Genetic Algorithm Using Artificial Neural Network in Da...Application of Hybrid Genetic Algorithm Using Artificial Neural Network in Da...
Application of Hybrid Genetic Algorithm Using Artificial Neural Network in Da...IOSRjournaljce
 
Comparative analysis of dynamic programming algorithms to find similarity in ...
Comparative analysis of dynamic programming algorithms to find similarity in ...Comparative analysis of dynamic programming algorithms to find similarity in ...
Comparative analysis of dynamic programming algorithms to find similarity in ...eSAT Journals
 
Comparative analysis of dynamic programming
Comparative analysis of dynamic programmingComparative analysis of dynamic programming
Comparative analysis of dynamic programmingeSAT Publishing House
 
Performance Efficient DNA Sequence Detectionalgo
Performance Efficient DNA Sequence DetectionalgoPerformance Efficient DNA Sequence Detectionalgo
Performance Efficient DNA Sequence DetectionalgoRahul Shirude
 
27 20 dec16 13794 28120-1-sm(edit)genap
27 20 dec16 13794 28120-1-sm(edit)genap27 20 dec16 13794 28120-1-sm(edit)genap
27 20 dec16 13794 28120-1-sm(edit)genapnooriasukmaningtyas
 
Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification?
Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification? Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification?
Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification? IJORCS
 
Pattern Recognition using Artificial Neural Network
Pattern Recognition using Artificial Neural NetworkPattern Recognition using Artificial Neural Network
Pattern Recognition using Artificial Neural NetworkEditor IJCATR
 
PERFORMANCE ANALYSIS OF HYBRID FORECASTING MODEL IN STOCK MARKET FORECASTING
PERFORMANCE ANALYSIS OF HYBRID FORECASTING MODEL IN STOCK MARKET FORECASTINGPERFORMANCE ANALYSIS OF HYBRID FORECASTING MODEL IN STOCK MARKET FORECASTING
PERFORMANCE ANALYSIS OF HYBRID FORECASTING MODEL IN STOCK MARKET FORECASTINGIJMIT JOURNAL
 
A Survey on Bioinformatics Tools
A Survey on Bioinformatics ToolsA Survey on Bioinformatics Tools
A Survey on Bioinformatics Toolsidescitation
 
Criminal and Civil Identification with DNA Databases Using Bayesian Networks
Criminal and Civil Identification with DNA Databases Using Bayesian NetworksCriminal and Civil Identification with DNA Databases Using Bayesian Networks
Criminal and Civil Identification with DNA Databases Using Bayesian NetworksCSCJournals
 
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...gerogepatton
 
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...gerogepatton
 
GRAPH ALGORITHM TO FIND CORE PERIPHERY STRUCTURES USING MUTUAL K-NEAREST NEIG...
GRAPH ALGORITHM TO FIND CORE PERIPHERY STRUCTURES USING MUTUAL K-NEAREST NEIG...GRAPH ALGORITHM TO FIND CORE PERIPHERY STRUCTURES USING MUTUAL K-NEAREST NEIG...
GRAPH ALGORITHM TO FIND CORE PERIPHERY STRUCTURES USING MUTUAL K-NEAREST NEIG...ijaia
 
International Journal of Computer Science and Security Volume (2) Issue (5)
International Journal of Computer Science and Security Volume (2) Issue (5)International Journal of Computer Science and Security Volume (2) Issue (5)
International Journal of Computer Science and Security Volume (2) Issue (5)CSCJournals
 

Similar a Stock markets and_human_genomics (20)

Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
Model of Differential Equation for Genetic Algorithm with Neural Network (GAN...
 
Discover How Scientific Data is Used for the Public Good with Natural Languag...
Discover How Scientific Data is Used for the Public Good with Natural Languag...Discover How Scientific Data is Used for the Public Good with Natural Languag...
Discover How Scientific Data is Used for the Public Good with Natural Languag...
 
Capital market applications of neural networks etc
Capital market applications of neural networks etcCapital market applications of neural networks etc
Capital market applications of neural networks etc
 
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
 
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
Performance Improvement of BLAST with Use of MSA Techniques to Search Ancesto...
 
Automatic Parallelization for Parallel Architectures Using Smith Waterman Alg...
Automatic Parallelization for Parallel Architectures Using Smith Waterman Alg...Automatic Parallelization for Parallel Architectures Using Smith Waterman Alg...
Automatic Parallelization for Parallel Architectures Using Smith Waterman Alg...
 
Application of Hybrid Genetic Algorithm Using Artificial Neural Network in Da...
Application of Hybrid Genetic Algorithm Using Artificial Neural Network in Da...Application of Hybrid Genetic Algorithm Using Artificial Neural Network in Da...
Application of Hybrid Genetic Algorithm Using Artificial Neural Network in Da...
 
Comparative analysis of dynamic programming algorithms to find similarity in ...
Comparative analysis of dynamic programming algorithms to find similarity in ...Comparative analysis of dynamic programming algorithms to find similarity in ...
Comparative analysis of dynamic programming algorithms to find similarity in ...
 
Comparative analysis of dynamic programming
Comparative analysis of dynamic programmingComparative analysis of dynamic programming
Comparative analysis of dynamic programming
 
Performance Efficient DNA Sequence Detectionalgo
Performance Efficient DNA Sequence DetectionalgoPerformance Efficient DNA Sequence Detectionalgo
Performance Efficient DNA Sequence Detectionalgo
 
27 20 dec16 13794 28120-1-sm(edit)genap
27 20 dec16 13794 28120-1-sm(edit)genap27 20 dec16 13794 28120-1-sm(edit)genap
27 20 dec16 13794 28120-1-sm(edit)genap
 
Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification?
Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification? Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification?
Commentz-Walter: Any Better than Aho-Corasick for Peptide Identification?
 
Pattern Recognition using Artificial Neural Network
Pattern Recognition using Artificial Neural NetworkPattern Recognition using Artificial Neural Network
Pattern Recognition using Artificial Neural Network
 
PERFORMANCE ANALYSIS OF HYBRID FORECASTING MODEL IN STOCK MARKET FORECASTING
PERFORMANCE ANALYSIS OF HYBRID FORECASTING MODEL IN STOCK MARKET FORECASTINGPERFORMANCE ANALYSIS OF HYBRID FORECASTING MODEL IN STOCK MARKET FORECASTING
PERFORMANCE ANALYSIS OF HYBRID FORECASTING MODEL IN STOCK MARKET FORECASTING
 
A Survey on Bioinformatics Tools
A Survey on Bioinformatics ToolsA Survey on Bioinformatics Tools
A Survey on Bioinformatics Tools
 
Criminal and Civil Identification with DNA Databases Using Bayesian Networks
Criminal and Civil Identification with DNA Databases Using Bayesian NetworksCriminal and Civil Identification with DNA Databases Using Bayesian Networks
Criminal and Civil Identification with DNA Databases Using Bayesian Networks
 
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
 
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...
 
GRAPH ALGORITHM TO FIND CORE PERIPHERY STRUCTURES USING MUTUAL K-NEAREST NEIG...
GRAPH ALGORITHM TO FIND CORE PERIPHERY STRUCTURES USING MUTUAL K-NEAREST NEIG...GRAPH ALGORITHM TO FIND CORE PERIPHERY STRUCTURES USING MUTUAL K-NEAREST NEIG...
GRAPH ALGORITHM TO FIND CORE PERIPHERY STRUCTURES USING MUTUAL K-NEAREST NEIG...
 
International Journal of Computer Science and Security Volume (2) Issue (5)
International Journal of Computer Science and Security Volume (2) Issue (5)International Journal of Computer Science and Security Volume (2) Issue (5)
International Journal of Computer Science and Security Volume (2) Issue (5)
 

Más de Shyam Sarkar

Scry analytics article on data analytics outsourcing, nov. 18, 2014
Scry analytics article on data analytics outsourcing, nov. 18, 2014Scry analytics article on data analytics outsourcing, nov. 18, 2014
Scry analytics article on data analytics outsourcing, nov. 18, 2014Shyam Sarkar
 
Tagores russiar chithi_paper
Tagores russiar chithi_paperTagores russiar chithi_paper
Tagores russiar chithi_paperShyam Sarkar
 
Decision tree handson
Decision tree handsonDecision tree handson
Decision tree handsonShyam Sarkar
 
Cancer genomics big_datascience_meetup_july_14_2014
Cancer genomics big_datascience_meetup_july_14_2014Cancer genomics big_datascience_meetup_july_14_2014
Cancer genomics big_datascience_meetup_july_14_2014Shyam Sarkar
 
Serial number java_code
Serial number java_codeSerial number java_code
Serial number java_codeShyam Sarkar
 
Technology treasury-management-2013
Technology treasury-management-2013Technology treasury-management-2013
Technology treasury-management-2013Shyam Sarkar
 
UN-Creative economy-report-2013
UN-Creative economy-report-2013UN-Creative economy-report-2013
UN-Creative economy-report-2013Shyam Sarkar
 
Local exchanges for_sm_es
Local exchanges for_sm_esLocal exchanges for_sm_es
Local exchanges for_sm_esShyam Sarkar
 
Innovative+agricultural+sme+finance+models
Innovative+agricultural+sme+finance+modelsInnovative+agricultural+sme+finance+models
Innovative+agricultural+sme+finance+modelsShyam Sarkar
 
Forrester big data_predictive_analytics
Forrester big data_predictive_analyticsForrester big data_predictive_analytics
Forrester big data_predictive_analyticsShyam Sarkar
 
Cancer genome repository_berkeley
Cancer genome repository_berkeleyCancer genome repository_berkeley
Cancer genome repository_berkeleyShyam Sarkar
 
Big security for_big_data
Big security for_big_dataBig security for_big_data
Big security for_big_dataShyam Sarkar
 
Renewable energy report
Renewable energy reportRenewable energy report
Renewable energy reportShyam Sarkar
 
Wef big databigimpact_briefing_2012
Wef big databigimpact_briefing_2012Wef big databigimpact_briefing_2012
Wef big databigimpact_briefing_2012Shyam Sarkar
 
Green technology report_2012
Green technology report_2012Green technology report_2012
Green technology report_2012Shyam Sarkar
 
Portfolio investment opportuities in india
Portfolio investment opportuities in indiaPortfolio investment opportuities in india
Portfolio investment opportuities in indiaShyam Sarkar
 

Más de Shyam Sarkar (20)

Scry analytics article on data analytics outsourcing, nov. 18, 2014
Scry analytics article on data analytics outsourcing, nov. 18, 2014Scry analytics article on data analytics outsourcing, nov. 18, 2014
Scry analytics article on data analytics outsourcing, nov. 18, 2014
 
Tagores russiar chithi_paper
Tagores russiar chithi_paperTagores russiar chithi_paper
Tagores russiar chithi_paper
 
Decision tree handson
Decision tree handsonDecision tree handson
Decision tree handson
 
Cancer genomics big_datascience_meetup_july_14_2014
Cancer genomics big_datascience_meetup_july_14_2014Cancer genomics big_datascience_meetup_july_14_2014
Cancer genomics big_datascience_meetup_july_14_2014
 
Serial number java_code
Serial number java_codeSerial number java_code
Serial number java_code
 
Technology treasury-management-2013
Technology treasury-management-2013Technology treasury-management-2013
Technology treasury-management-2013
 
UN-Creative economy-report-2013
UN-Creative economy-report-2013UN-Creative economy-report-2013
UN-Creative economy-report-2013
 
Local exchanges for_sm_es
Local exchanges for_sm_esLocal exchanges for_sm_es
Local exchanges for_sm_es
 
Innovative+agricultural+sme+finance+models
Innovative+agricultural+sme+finance+modelsInnovative+agricultural+sme+finance+models
Innovative+agricultural+sme+finance+models
 
Religionofman
ReligionofmanReligionofman
Religionofman
 
Forrester big data_predictive_analytics
Forrester big data_predictive_analyticsForrester big data_predictive_analytics
Forrester big data_predictive_analytics
 
Cancer genome repository_berkeley
Cancer genome repository_berkeleyCancer genome repository_berkeley
Cancer genome repository_berkeley
 
Big security for_big_data
Big security for_big_dataBig security for_big_data
Big security for_big_data
 
Renewable energy report
Renewable energy reportRenewable energy report
Renewable energy report
 
Nasa on biofuel
Nasa on biofuelNasa on biofuel
Nasa on biofuel
 
Wef big databigimpact_briefing_2012
Wef big databigimpact_briefing_2012Wef big databigimpact_briefing_2012
Wef big databigimpact_briefing_2012
 
World bank report
World bank reportWorld bank report
World bank report
 
Green technology report_2012
Green technology report_2012Green technology report_2012
Green technology report_2012
 
Portfolio investment opportuities in india
Portfolio investment opportuities in indiaPortfolio investment opportuities in india
Portfolio investment opportuities in india
 
Tapan 29 jun
Tapan 29 junTapan 29 jun
Tapan 29 jun
 

Stock markets and_human_genomics

  • 1. Prakash Kumar Sarangi et al. / International Journal of Engineering Science and Technology (IJEST) A Compression- Based Technique for Comparing Stock Market Patterns Be- havior with Human Genome Prakash Kumar Sarangi Department of Information Technology NM Institute of Engineering and Technology, Bhubaneswar, India. Prakash_sarangi89@yahoo.com. Birendra Kumar Nayak Department of Mathematic, Utkal University, Bhubaneswar, India. bknatuu@yahoo.co.uk. Sachidananda Dehuri Department of Information & Communication Fakir Mohan University, Balasore , India. Satchi.lapa@gmail.com. Abstract In this paper we propose a new approach for comparing stock market patterns behavior with DNA sequences using a compression based technique. The behavior of the stock market is put into sequence of 0’s and 1’s which was converted to the sequence of nucleotides A, T, C, G. Here we propose a compression algorithm “Huffman Coding “for DNA sequences based on a novel algorithm of assigning binary bit codes (0 and 1) for each base(A,C,G,T) to compress DNA sequence. This sequence so obtained is matched to the text DNA sequence by using BLAST. It is found that the certain sub-sequences of the sequence match cent percent with sub-sequences of Homo sapiens chromosome 19. Possibility using this approach to predict the stock market behavior is explored. Keywords: Huffman codes, Subsequence, Nucleotides, Local alignment. 1. INTRODUCTION For many years the following question has been a source of continuing controversy in both academic and business circles: To what extent can the past history of a common stock's price be used to make meaningful predictions concerning the future price of the stock? Answers to this question have been provided on the one hand by the various chartist theories and on the other hand by the theory of random walks. Although there are many different chartist theories, they all make the same basic assumption. That is, they all assume that the past behavior of a security's price is rich in information concerning its future behavior. History repeats itself in that "patterns" of past price behavior will tend to recur in the future. Thus, if through careful analysis of price charts one develops an understanding of these "patterns," this can be used to predict the future behavior of prices and in this way increase expected gains [1]. Due to its randomness, lots of research has going on for studying behavior of stock market. In 1959, Roberts wrote” If the stock market behaved like a mechanically imperfect roulette wheel, people would notice the imperfections and, by acting on them, remove them. This rationale is appealing, if for no other reason than its value as counterweight to the popular view of stock market “irrationality,” but it is obviously incomplete. Roberts generated a series of random numbers and plot result to see whether any patterns that were known to technical analysts would be visible [2]. In another way many work has been done using intelligent computational technique like Hidden Markov Model (HMM), Artificial Neural Networks (ANN) and Genetic Algorithms (GA) to forecast financial market behavior [3-5]. But in this paper we are putting a relationship between behaviors of stock market with DNA sequences. For above analysis we need support of Bio-informatics tools like BLAST. The primary goal of bioinformatics is to increase the understanding of biological processes. Bioinformatics [6], the application of computational techniques to analyze the information associated with bi-molecules on a large scale, has now firmly established itself as a discipline in molecular biology. Bioinformatics is a management information system for molecular biology. Bioinformatics encompasses everything from data storage and retrieval to the identification and presentation of features within data, such as finding genes within ISSN : 0975-5462 Vol. 4 No.01 January 2012 144
  • 2. Prakash Kumar Sarangi et al. / International Journal of Engineering Science and Technology (IJEST) DNA sequence, finding similarities between sequences, structural predictions [7]. Using such BLAST software we generate a relationship between them. Also we can predict future aspects of stock market. The main motivation of this paper is to propose a comparison between DNA sequences with stock market tendency and to test the predictability of the proposed BLAST software. The rest of the study is organized as follows. The next section will describe the methodology which processing in detail like mapping, encoding, partitioning, and matching. In Section 3, we give an experiment scheme and Empirical results and analysis are reported in this section. The concluding remarks are given in Section 4. In last Section we propose future work for prediction of stock market. 2. METHODOLOGY In this section, the closing price of day to day trading builds a process is presented in detail mapping with human genome. First of all, a mapping of stock price to binary is described. Then encode these binary values to nucleotides using Huffman tree to compress total data to half. Nucleotides are divided in to several DNA sequences having a continuous distribution. Each part matched using BLAST, which finally give a result as establish a relation between human genome with stock market behavior. 2.1. Representation of Stock behavior to Binary This study is to map and explore the tendency of stock price index. The research data used in this study is technical indicators and the direction of change in the daily S&P500 stock price index thirty years. Considering their closing price of each day, they are categorized as “0” and “1” in the research data. “0” means that the next day’s index is lower or same to today’s index, and “1” means that the next day’s index is higher than today’s index [8]. 2.2. Proposed Huffman Algorithm for Encoding DNA, or deoxyribonucleic acid, is the hereditary material in humans and almost all other organisms. An important property of DNA is that it can replicate, or make copies of itself. Each strand of DNA in the double helix can serve as a pattern for duplicating the sequence of bases. This is critical when cells divide because each new cell needs to have an exact copy of the DNA present in the old cell [9]. The information in DNA is stored as a code made up of four chemical bases: adenine (A), guanine (G), cytosine (C), and thymine (T). DNA bases pair up with each other, A with T and C with G, to form units called base pairs. The specific bit sequence assigned to an individual base is determined by tracing out the path from the root of the Huffman tree to the leaf that represents that Base. By convention, bit '0' represents following the left child when tracing out the path and bit '1' represents following the right child when tracing out the path. The Huffman tree is constructed such that the paths from the root to the most frequently used bases are short while the paths to less frequently used bases are long. This results in short codes for frequently used bases and long codes for less frequently used bases. Now here we found that all are having same length so it is consider as fixed length encoding process. If the sequences are encoded using the trivial method of assigning 2 bits per base. Given a DNA sequence consisting of A, C, T, G characters, we use two bits to encode each character:  “00” for A,  “01” for C,  “11” for T, and  “10” for G. As a result, each cell of 2 bits representing one DNA character. As we know in DNA chaining “A” bonding with “T” and “ C” bonding with “G” , we generate a rule which pairs are 1’s complement with each other [10]. For an example, DNA sequence TACCTGCGCTA is encoded by binary sequence 11 00 01 01 11 10 01 10 01 11 00. 2.3. Building of DNA Patterns Entire compressed DNA pattern of thirty years are divided into six parts; each part corresponds to five years of stock market behavior. Since each parts are a form of DNA sequence, we can say each part have a life. Now we compare with a very large DNA database to identify this pattern behavior align with any species. There are many pattern matching algorithms to match pattern of any data, but in bioinformatics we have very user friendly tool BLAST, which have potential to find different patterns. 2.4. Multiple Sequence Alignment using BLAST BLAST (Basic Local Alignment Search Tool): family of sequence alignment algorithms developed by Altschul et. al. 1997. These programs are used for sequence similarity identification [7]. They identify regions of local alignment to assist in detecting relationships among sequences, which allows the user to identify similarities between the query nucleotide or protein sequence with sequences in public databases, Identifies clusters of nearby or locally dense "similar" k-tuples (number of string of letters), Used to identify whether a given ISSN : 0975-5462 Vol. 4 No.01 January 2012 145
  • 3. Prakash Kumar Sarangi et al. / International Journal of Engineering Science and Technology (IJEST) sequence is novel, homologous to a known sequence, or if the sequence contains motifs which may provide clues to a possible roles of the sequence being queried [7]. The preferred query sequence format for the BLAST program is the FASTA format which, take input as DNA sequences. Advanced BLAST tolerates both spaces and numbers and is case insensitive. After some time it produce format having a Request ID number, E value, max sore, percentage of identified, also species name. Now each part of patterns are align with the large DNA database of BLAST. It is found that thirty years stock patterns behavior perform a regular match with species like human being in each individual pattern matching. Each sub-sequences of stock market cent percent match with Homo sapiens chromosome 19. 3. EXPERIMENTAL RESULTS The entire data set contains close price of S&P500 of thirty years which, covers the period from first trading day of January, 1980 to last trading day of December, 2010. The data sets are divided into six periods having five years each. The first period covers from January, 1980 to January, 1985, the second period is from January, 1985 to January, 1990, third period is from January, 1990 to January, 1995, fourth period is from January 1995 to January 2000, fifth period is from January, 2000 to January, 2005 and sixth period is from January 2005 to December, 2010. Using BLAST we found that each part of DNA is cent percent match with DNA of Homo sapiens chromosome 19 having gap zero percent. Homo sapiens chromosome 19 genomic contains 15894584 of nucleotides. Above six part are pattern match with such nucleotides uniformly cent percent. Also if will divide entire data set to three parts, the first period is from January, 1980 to January, 1990, the second period is from January, 1990 to January, 2000 and third period is from January, 2000 to December, 2010. Using same technique, we found highly similar identification with same species. From experimental results following table- 1 represents entire report of the year 1980 to 2010 comparing between each five years. Similarly table -2 represents comparison result of both DNA patterns in each decade start from 1980 to 2010. Table-1, maximum identification during each five years Year duration DNA Max. Max. Identi- length Score fied 1980-1985 632 39.2 100% 1985-1990 631 39.2 100% 1990-1995 632 39.2 100% 1995-2000 627 39.2 100% 2000-2005 639 39.2 100% 2005-2010 640 39.2 100% Table-2, maximum identification during each ten years Year duration DNA Max. Max. Identi- length Score fied 1980-1990 1263 39.2 100% 1990-2000 1259 39.2 100% 2000-2010 1279 39.2 100% 4. CONCLUSION & FUTURE WORK This study proposes using bioinformatics tool BLAST that perform a relationship between stock market behaviors with DNA sequences. In terms of the empirical results, we find that each five years or each decade the stock market tendency behaves like human DNA sequence. The alignment score says that between them maximum identification is cent percent in each part. But for prediction purpose it is possible when continuous ISSN : 0975-5462 Vol. 4 No.01 January 2012 146
  • 4. Prakash Kumar Sarangi et al. / International Journal of Engineering Science and Technology (IJEST) matching occurs. From experimental work we found that maximum identification not exactly equal to 100% in each 15 years. As we found from above experiment each five years stock data are pattern matched with human genome. Also stock market is fully random, for prediction of stock price possible for next five years. This is the future work to predict behavior of stock market for coming trading days. 5. REFERENCES [1] Hasan, A.; Saleem, HM.; Abdullah, S.; “Long- Run Relationships between an Emerging Equity Market and Equity Markets of the Developed World an Empirical Analysis of Karachi Stock Exchange,” International Research Journal of Finance and Economics, 2008, 16, pp.52-62. [2] Robert, H.; “Stock Market ‘Patterns’ and Financial Analysis, Journal of Finance , 1959 [3] Kamijo, K.; Tanigawa, T.; Stock Price Pattern Recognition: A Recurrent Neural Network Approach, In Proceedings of the International Joint Conference on Neural Networks, San Diego, CA (1990) 215-221. [4] Tsaih, R.; Hsu, Y.; Lai, C.C.; Forecasting S&P 500 Index Futures with a Hybrid AI system. Decision Support Systems 23 (1998) 161-174. [5] Hassan, M.R.; Nath, B.; Kirley. M.; A fusion model of HMM, ANN and GA for stock market forecasting, Expert Systems with Applications 33 (2007) 171–180. [6] Li, F.; Stormo, D. G.; Selection of optimal DNA oligos for gene expression arrays. Bioinformatics, 17: 1067- [7] 1076, http://bioinformatics.oxfordjournals.org/cgi/content /abstract/17/11/1067. [8] http://www.ncbi.nlm.nih.gov/BLAST. [9] Yu, L.; Wang, S.; Lai, K. K.; Mining Stock Market Tendency Using GA-Based Support Vector Machines, WINE 2005, LNCS 3828, pp. 336 – 345, 2005. [10] Karp, R.; Rabin, M.; An efficient randomized pattern-matching algorithms, IBM Journal of Research and Development, 31(2):249–260, 1987. [11] Rajarajeswari, p.; Apparao, A.; Kiran, K. R.; Huffbit Compress – Algorithm to Compress DNA Sequences Using Extended Binary Trees, Journal of Theoretical and Applied Information Technology, 2005. ISSN : 0975-5462 Vol. 4 No.01 January 2012 147