A grammar based methodology for structural motif finding in ncRNA database search.

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In recent years, sequence database searching has been conducted through local alignment heuristics, pattern-matching, and comparison of short statistically significant patterns. While these approaches have unlocked many clues as to sequence relationships, they are limited in that they do not provide context-sensitive searching capabilities (e.g. considering pseudoknots, protein binding positions, and complementary base pairs). Stochastic grammars (hidden Markov models HMMs and stochastic context-free grammars SCFG) do allow for flexibility in terms of local context, but the context comes at the cost of increased computational complexity. In this paper we introduce a new grammar based method for searching for RNA motifs that exist within a conserved RNA structure. Our method constrains computational complexity by using a chain of topology elements. Through the use of a case study we present the algorithmic approach and benchmark our approach against traditional methods.

Original languageEnglish (US)
Pages (from-to)215-225
Number of pages11
JournalComputational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference
Volume6
StatePublished - Jan 1 2007

Fingerprint

Databases
Benchmarking
Nucleotide Motifs
Protein Binding
Base Pairing
RNA
Heuristics

ASJC Scopus subject areas

  • Medicine(all)

Cite this

@article{c13373f90fc844199695ce0f9d46984d,
title = "A grammar based methodology for structural motif finding in ncRNA database search.",
abstract = "In recent years, sequence database searching has been conducted through local alignment heuristics, pattern-matching, and comparison of short statistically significant patterns. While these approaches have unlocked many clues as to sequence relationships, they are limited in that they do not provide context-sensitive searching capabilities (e.g. considering pseudoknots, protein binding positions, and complementary base pairs). Stochastic grammars (hidden Markov models HMMs and stochastic context-free grammars SCFG) do allow for flexibility in terms of local context, but the context comes at the cost of increased computational complexity. In this paper we introduce a new grammar based method for searching for RNA motifs that exist within a conserved RNA structure. Our method constrains computational complexity by using a chain of topology elements. Through the use of a case study we present the algorithmic approach and benchmark our approach against traditional methods.",
author = "Daniel Quest and Tapprich, {William E} and Ali, {Hesham H}",
year = "2007",
month = "1",
day = "1",
language = "English (US)",
volume = "6",
pages = "215--225",
journal = "Computational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference",
issn = "1752-7791",
publisher = "Imperial College Press",

}

TY - JOUR

T1 - A grammar based methodology for structural motif finding in ncRNA database search.

AU - Quest, Daniel

AU - Tapprich, William E

AU - Ali, Hesham H

PY - 2007/1/1

Y1 - 2007/1/1

N2 - In recent years, sequence database searching has been conducted through local alignment heuristics, pattern-matching, and comparison of short statistically significant patterns. While these approaches have unlocked many clues as to sequence relationships, they are limited in that they do not provide context-sensitive searching capabilities (e.g. considering pseudoknots, protein binding positions, and complementary base pairs). Stochastic grammars (hidden Markov models HMMs and stochastic context-free grammars SCFG) do allow for flexibility in terms of local context, but the context comes at the cost of increased computational complexity. In this paper we introduce a new grammar based method for searching for RNA motifs that exist within a conserved RNA structure. Our method constrains computational complexity by using a chain of topology elements. Through the use of a case study we present the algorithmic approach and benchmark our approach against traditional methods.

AB - In recent years, sequence database searching has been conducted through local alignment heuristics, pattern-matching, and comparison of short statistically significant patterns. While these approaches have unlocked many clues as to sequence relationships, they are limited in that they do not provide context-sensitive searching capabilities (e.g. considering pseudoknots, protein binding positions, and complementary base pairs). Stochastic grammars (hidden Markov models HMMs and stochastic context-free grammars SCFG) do allow for flexibility in terms of local context, but the context comes at the cost of increased computational complexity. In this paper we introduce a new grammar based method for searching for RNA motifs that exist within a conserved RNA structure. Our method constrains computational complexity by using a chain of topology elements. Through the use of a case study we present the algorithmic approach and benchmark our approach against traditional methods.

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

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

M3 - Article

VL - 6

SP - 215

EP - 225

JO - Computational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference

JF - Computational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference

SN - 1752-7791

ER -