Data structuring application for string problems in biological sequences

  • Authors:

  • Y. Panagis;E. Theodoridis;K. Tsichlas

  • 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

In this work we present applications of data structuring techniques for string problems in biological sequences. We firstly consider the problem of approximate string matching with gaps and secondly the problem of identifying occurrences of maximal pairs in multiple strings. The proposed implementations can be used in many problems that arise in the field of Computational Molecular Biology.