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

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

Original languageEnglish
Title of host publication30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
EditorsNadia Pisanti, Solon P. Pissis
Number of pages16
Place of PublicationDagstuhl
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Publication date2019
Pages8:1-8:16
ISBN (Electronic)978-3-95977-103-0
DOIs
Publication statusPublished - 2019
MoE publication typeA4 Article in conference proceedings
EventAnnual Symposium on Combinatorial Pattern Matching: 30th Annual Symposium, CPM 2019 - Pisa, Italy
Duration: 18 Jun 201920 Jun 2019
Conference number: 30

Publication series

NameEdit Leibniz International Proceedings in Informatics (LIPIcs)
Volume128
ISSN (Electronic)1868-8969

Fields of Science

  • 113 Computer and information sciences

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). Dagstuhl: 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",

}

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 proceedingConference contributionScientificpeer-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

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

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)). https://doi.org/10.4230/LIPIcs.CPM.2019.8