Chinta Someswara Rao

Learn More
The string matching problem is one of the most studied problems in computer science. While it is very easily stated and many of the simple algorithms perform very well in practice, numerous works have been published on the subject and research is still very active. In this paper we propose a butterfly parallel computing model for parallel string matching.(More)
String matching plays a dominant role in digital computer world, because it is made up of huge digital information. Digital computer world users often face a problem to extract the relevant information from these huge digital data to their queries. Hence it requires efficient retrieval algorithms for retrieving relevant data from huge digital data. To(More)
In this paper, we consider correlation coefficient, rank correlation coefficient and cosine similarity measures for evaluating similarity between Homo sapiens and monkeys. We used DNA chromosomes of genome wide genes to determine the correlation between the chromosomal content and evolutionary relationship. The similarity among the H. sapiens and monkeys is(More)
Next generation sequencing (NGS) technologies have been rapidly applied in biomedical and biological research in recent years. To provide the comprehensive NGS resource for the research, in this paper , we have considered 10 loci/codi/repeats TAGA, TCAT, GAAT, AGAT, AGAA, GATA, TATC, CTTT, TCTG and TCTA. Then we developed the NGS Tandem Repeat Database(More)
In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data. Sequential pattern mining is applicable in this area, since many types of data sets are in a time related format. Besides mining sequential patterns in a single dimension, mining multidimensional sequential patterns(More)
  • 1