Constraints

, Volume 6, Issue 2, pp 173–200

A Constraint Based Structure Description Language for Biosequences

  • Ingvar Eidhammer
  • Inge Jonassen
  • Svenn Helge Grindhaug
  • David Gilbert
  • Madu Ratnayake
Article

DOI: 10.1023/A:1011481521835

Cite this article as:
Eidhammer, I., Jonassen, I., Grindhaug, S.H. et al. Constraints (2001) 6: 173. doi:10.1023/A:1011481521835

Abstract

We report an investigation into how constraint solving techniques can be used to search for patterns in sequences (or strings) of symbols over a finite alphabet. We define a constraint-based structure description language for biosequences, and give the definition of an algorithm to solve the structure searching problem as a CSP. The methodology which we have developed is able to describe two-dimensional structure of biosequences, such as tandem repeats, stem loops, palindromes and pseudo-knots. We also report on an implementation of the language in the constraint logic programming language clp(FD), with test results of a simple searching algorithm, and results from a preliminary implementation in C++ using consistency checking techniques from solving CSP.

constraints biostructures description language searching 

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Ingvar Eidhammer
    • 1
  • Inge Jonassen
    • 1
  • Svenn Helge Grindhaug
    • 1
  • David Gilbert
    • 2
  • Madu Ratnayake
    • 2
  1. 1.Department of InformaticsUniversity of Bergen, HIBBergenNorway
  2. 2.Department of ComputingLondonUnited Kingdom

Personalised recommendations