TY - GEN
T1 - Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach
AU - Zakov, Shay
AU - Tsur, Dekel
AU - Ziv-Ukelson, Michal
PY - 2010/11/10
Y1 - 2010/11/10
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/78049469991
U2 - 10.1007/978-3-642-15294-8_6
DO - 10.1007/978-3-642-15294-8_6
M3 - Conference contribution
AN - SCOPUS:78049469991
SN - 3642152937
SN - 9783642152931
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 65
EP - 77
BT - Algorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings
T2 - 10th International Workshop on Algorithms in Bioinformatics, WABI 2010
Y2 - 6 September 2010 through 8 September 2010
ER -