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

    Fingerprint

    Efficient Algorithms
    Testing
    DNA sequences
    Secondary Structure
    DNA Sequence
    Open Problems

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    @article{b4e7db890911455c9039e6488daaeae1,
    title = "An algorithm for testing structure freeness of biomolecular sequences",
    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.",
    author = "Satoshi Kobayashi and Takashi Yokomori and Yasubumi Sakakibara",
    year = "2004",
    language = "English",
    volume = "2950",
    pages = "266--277",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    TY - JOUR

    T1 - An algorithm for testing structure freeness of biomolecular sequences

    AU - Kobayashi, Satoshi

    AU - Yokomori, Takashi

    AU - Sakakibara, Yasubumi

    PY - 2004

    Y1 - 2004

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=35048833831&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=35048833831&partnerID=8YFLogxK

    M3 - Article

    VL - 2950

    SP - 266

    EP - 277

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -