An algorithm for testing structure freeness of biomolecular sequences

Satoshi Kobayashi, Takashi Yokomori, Yasubumi Sakakibara

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

We are concerned with a problem of checking the structure freeness of S + for a given set 5 of DNA sequences. It is still open whether or not there exists an efficient algorithm for this problem. In this paper, we will give an efficient algorithm to check the structure freeness of S + under the constraint that every sequence may form only linear secondary structures, which partially solves the open problem.

Original languageEnglish
Pages (from-to)266-277
Number of pages12
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2950
Publication statusPublished - 2004 Dec 1

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this