Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding

Niko Kiirala; Leena Salmela; Alexandru Tomescu

doi:10.4230/LIPIcs.CPM.2019.8

Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding

Niko Kiirala, Leena Salmela, Alexandru Tomescu

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

Original language	English
Title of host publication	30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
Editors	Nadia Pisanti, Solon P. Pissis
Number of pages	16
Place of Publication	Dagstuhl
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Publication date	2019
Pages	8:1-8:16
ISBN (Electronic)	978-3-95977-103-0
DOIs	https://doi.org/10.4230/LIPIcs.CPM.2019.8
Publication status	Published - 2019
MoE publication type	A4 Article in conference proceedings
Event	Annual Symposium on Combinatorial Pattern Matching: 30th Annual Symposium, CPM 2019 - Pisa, Italy Duration: 18 Jun 2019 → 20 Jun 2019 Conference number: 30

Publication series

Name	Edit Leibniz International Proceedings in Informatics (LIPIcs)
Volume	128
ISSN (Electronic)	1868-8969

Fields of Science

113 Computer and information sciences

Access to Document

10.4230/LIPIcs.CPM.2019.8Licence: CC BY

LIPIcs-CPM-2019-8Final published version, 777 KBLicence: CC BY

Cite this

Kiirala, N., Salmela, L., & Tomescu, A. (2019). Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. In N. Pisanti, & S. P. Pissis (Eds.), 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) (pp. 8:1-8:16). (Edit Leibniz International Proceedings in Informatics (LIPIcs); Vol. 128). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CPM.2019.8

Kiirala, Niko ; Salmela, Leena ; Tomescu, Alexandru. / Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). editor / Nadia Pisanti ; Solon P. Pissis. Dagstuhl : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. pp. 8:1-8:16 (Edit Leibniz International Proceedings in Informatics (LIPIcs)).

@inproceedings{d400983fb53147658bd24ad621a642e9,

title = "Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding",

keywords = "113 Computer and information sciences",

author = "Niko Kiirala and Leena Salmela and Alexandru Tomescu",

year = "2019",

doi = "10.4230/LIPIcs.CPM.2019.8",

language = "English",

series = "Edit Leibniz International Proceedings in Informatics (LIPIcs)",

publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",

pages = "8:1--8:16",

editor = "Nadia Pisanti and Pissis, {Solon P.}",

booktitle = "30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)",

address = "Germany",

note = "Annual Symposium on Combinatorial Pattern Matching : 30th Annual Symposium, CPM 2019, CPM: Annual Symposium on Combinatorial Pattern Matching ; Conference date: 18-06-2019 Through 20-06-2019",

}

Kiirala, N, Salmela, L & Tomescu, A 2019, Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. in N Pisanti & SP Pissis (eds), 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). Edit Leibniz International Proceedings in Informatics (LIPIcs), vol. 128, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, pp. 8:1-8:16, Annual Symposium on Combinatorial Pattern Matching, Pisa, Italy, 18/06/2019. https://doi.org/10.4230/LIPIcs.CPM.2019.8

Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. / Kiirala, Niko; Salmela, Leena ; Tomescu, Alexandru.
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). ed. / Nadia Pisanti; Solon P. Pissis. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. p. 8:1-8:16 (Edit Leibniz International Proceedings in Informatics (LIPIcs); Vol. 128).

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

TY - GEN

T1 - Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding

AU - Kiirala, Niko

AU - Salmela, Leena

AU - Tomescu, Alexandru

N1 - Conference code: 30

PY - 2019

Y1 - 2019

KW - 113 Computer and information sciences

U2 - 10.4230/LIPIcs.CPM.2019.8

DO - 10.4230/LIPIcs.CPM.2019.8

M3 - Conference contribution

T3 - Edit Leibniz International Proceedings in Informatics (LIPIcs)

SP - 8:1-8:16

BT - 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)

A2 - Pisanti, Nadia

A2 - Pissis, Solon P.

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

CY - Dagstuhl

T2 - Annual Symposium on Combinatorial Pattern Matching

Y2 - 18 June 2019 through 20 June 2019

ER -

Kiirala N, Salmela L , Tomescu A. Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. In Pisanti N, Pissis SP, editors, 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2019. p. 8:1-8:16. (Edit Leibniz International Proceedings in Informatics (LIPIcs)). doi: 10.4230/LIPIcs.CPM.2019.8