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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Zakov, S., Tsur, D., & Ziv-Ukelson, M. (2010). Reducing the worst case running times of a family of RNA and CFG problems, using Valiant’s approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6293 LNBI, pp. 65–77). https://doi.org/10.1007/978-3-642-15294-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
