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

Shay Zakov; Dekel Tsur; Michal Ziv-Ukelson

doi:10.1007/978-3-642-15294-8_6

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

Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 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 language	English
Title of host publication	Algorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings
Pages	65-77
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-642-15294-8_6
State	Published - 10 Nov 2010
Event	10th International Workshop on Algorithms in Bioinformatics, WABI 2010 - Liverpool, United Kingdom Duration: 6 Sep 2010 → 8 Sep 2010

Publication series

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

Conference

Conference	10th International Workshop on Algorithms in Bioinformatics, WABI 2010
Country/Territory	United Kingdom
City	Liverpool
Period	6/09/10 → 8/09/10

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-15294-8_6

Cite this

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 Algorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings (pp. 65-77). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6293 LNBI). https://doi.org/10.1007/978-3-642-15294-8_6

Zakov, Shay ; Tsur, Dekel ; Ziv-Ukelson, Michal. / Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. Algorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings. 2010. pp. 65-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{7820e605c65c4e16aeb3bbd2257e4892,

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

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.",

author = "Shay Zakov and Dekel Tsur and Michal Ziv-Ukelson",

note = "Funding Information: The time complexities of the VMT algorithms we describe here are dictated by the time complexities of matrix multiplication algorithms. As matrix multiplication variants are essential operations in many computational problems, much work has been done to improve both the theoretical and the practical Acknowledgments. This work was partially supported by the Frankel Center for Computer Science at Ben Gurion University of the Negev.; 10th International Workshop on Algorithms in Bioinformatics, WABI 2010 ; Conference date: 06-09-2010 Through 08-09-2010",

year = "2010",

month = nov,

day = "10",

doi = "10.1007/978-3-642-15294-8_6",

language = "English",

isbn = "3642152937",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "65--77",

booktitle = "Algorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings",

}

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 Algorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6293 LNBI, pp. 65-77, 10th International Workshop on Algorithms in Bioinformatics, WABI 2010, Liverpool, United Kingdom, 6/09/10. https://doi.org/10.1007/978-3-642-15294-8_6

Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. / Zakov, Shay; Tsur, Dekel ; Ziv-Ukelson, Michal.
Algorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings. 2010. p. 65-77 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6293 LNBI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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

N1 - Funding Information: The time complexities of the VMT algorithms we describe here are dictated by the time complexities of matrix multiplication algorithms. As matrix multiplication variants are essential operations in many computational problems, much work has been done to improve both the theoretical and the practical Acknowledgments. This work was partially supported by the Frankel Center for Computer Science at Ben Gurion University of the Negev.

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 - http://www.scopus.com/inward/record.url?scp=78049469991&partnerID=8YFLogxK

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 -

Zakov S, Tsur D , Ziv-Ukelson M. Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. In Algorithms in Bioinformatics - 10th International Workshop, WABI 2010, Proceedings. 2010. p. 65-77. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-15294-8_6

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

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this