A Method to Find Uniq e Sequences on Distrib ted Genomic Databases

  • Authors:
  • Ken-ichi Kurata;Vincent Breton;Hiroshi Nakamura

  • Affiliations:
  • -;-;-

  • Venue:
  • CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Thanks to the development of genetic engineering, various kinds of genomic information are being unveiled.Hence, it becomes feasible to analyze the entire genomicinformation all at once. On the other hand, the quantity ofthe genomic information stocked on databases is increasingday after day. In order to process the whole information, wehave to develop an effective method to deal with lots of data.Therefore, it is indis ensable not only to make an effectiveand rapid algorithm but also to use high-speed computerresource so as to analyze the biological information. Forthis purpose, as one of the most promised computing environments, the grid computing architecture has appearedrecently. The European Data Grid (EDG) is one of the data-oriented grid computing environments [11].In the field of bioinformatics, it is important to findunique sequences to succeed in molecular biological experiments [6]. Once unique sequences have been found, theycan be useful for target specific probes/primers design, genesequence comparison and so on. In this paper, we propose amethod to discover unique sequences from among genomicdatabases located in a distributed environment. Next, weimplement this method upon the European Data Grid andshow the calculation results for E. coli genomes.