Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

We study Valiant's classical algorithm for Context Free Grammar recognition in sub-cubic time, and extract features that are common to problems on which Valiant's approach can be applied. Based on this, we describe several problem templates, and formulate generic algorithms that use Valiant's technique and can be applied to all problems which abide by these templates. These algorithms obtain new worst case running time bounds for a large family of important problems within the world of RNA Secondary Structures and Context Free Grammars.

Original languageEnglish
Title of host publicationAlgorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings
Pages65-77
Number of pages13
DOIs
StatePublished - 10 Nov 2010
Event10th International Workshop on Algorithms in Bioinformatics, WABI 2010 - Liverpool, United Kingdom
Duration: 6 Sep 20108 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6293 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Workshop on Algorithms in Bioinformatics, WABI 2010
Country/TerritoryUnited Kingdom
CityLiverpool
Period6/09/108/09/10

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach'. Together they form a unique fingerprint.

Cite this