Discovering regularities in biosequences: challenges and applications

  • Authors:

  • K. Perdikuri;C. Makris;A. Tsakalidis

  • Affiliations:

  • Research Academic Computer Technology Institute, 61 Riga Feraiou Str., 26221 PATRAS, GREECE and Computer Engineering and Informatics Department, University of Patras, 26500 PATRAS, GREECE;Research Academic Computer Technology Institute, 61 Riga Feraiou Str., 26221 PATRAS, GREECE and Computer Engineering and Informatics Department, University of Patras, 26500 PATRAS, GREECE;Research Academic Computer Technology Institute, 61 Riga Feraiou Str., 26221 PATRAS, GREECE and Computer Engineering and Informatics Department, University of Patras, 26500 PATRAS, GREECE

  • Venue:
  • ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Computational methods on molecular sequence data (strings) are at the heart of computational molecular biology. A DNA molecule can be thought of as a string over an alphabet of four characters {a,c,g,t} (nucleotides), while a protein can be thought of as a string over an alphabet of twenty characters (amino acids). A gene, which is physically embedded in a DNA molecule, typically encodes the amino acid sequence for a particular protein. Existing and emerging algorithms for string computation provide a significant intersection between computer science and molecular biology.