Computing longest common square subsequences

T. Inoue; S. Inenaga; H. Hyyrö; H. Bannai; M. Takeda

doi:10.4230/LIPIcs.CPM.2018.15

Computing longest common square subsequences

T. Inoue, S. Inenaga, H. Hyyrö, H. Bannai, M. Takeda

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

9 Citations (Scopus)

Original language	English
Title of host publication	29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
Editors	Gonzalo Navarro, David Sankoff, Binhai Zhu
Publisher	Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Pages	151-1513
Volume	105
ISBN (Print)	978-3-95977-074-3
DOIs	https://doi.org/10.4230/LIPIcs.CPM.2018.15
Publication status	Published - 2018
Publication type	A4 Article in conference proceedings
Event	Annual Symposium on Combinatorial Pattern Matching - Duration: 1 Jan 2018 → …

Publication series

Name	Leibniz International Proceedings in Informatics
Number	105
Volume	105
ISSN (Print)	1868-8969

Conference

Conference	Annual Symposium on Combinatorial Pattern Matching
Period	1/01/18 → …

Keywords

Dynamic programming
Matching rectangles
Squares
Subsequences

Publication forum classification

Publication forum level 1

Access to Document

10.4230/LIPIcs.CPM.2018.15

http://urn.fi/URN:NBN:fi:uta-201806292165

Cite this

Inoue, T., Inenaga, S., Hyyrö, H., Bannai, H., & Takeda, M. (2018). Computing longest common square subsequences. In G. Navarro, D. Sankoff, & B. Zhu (Eds.), 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018 (Vol. 105, pp. 151-1513). (Leibniz International Proceedings in Informatics; Vol. 105, No. 105). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CPM.2018.15

@inproceedings{5c312295771d457abe8c22f99f83de67,

title = "Computing longest common square subsequences",

keywords = "Dynamic programming, Matching rectangles, Squares, Subsequences, Dynamic programming, Matching rectangles, Squares, Subsequences",

author = "T. Inoue and S. Inenaga and H. Hyyr{\"o} and H. Bannai and M. Takeda",

year = "2018",

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

language = "English",

isbn = "978-3-95977-074-3",

volume = "105",

series = "Leibniz International Proceedings in Informatics",

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

number = "105",

pages = "151--1513",

editor = "Gonzalo Navarro and David Sankoff and Binhai Zhu",

booktitle = "29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018",

note = "Annual Symposium on Combinatorial Pattern Matching ; Conference date: 01-01-2018",

}

Inoue, T, Inenaga, S, Hyyrö, H, Bannai, H & Takeda, M 2018, Computing longest common square subsequences. in G Navarro, D Sankoff & B Zhu (eds), 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. vol. 105, Leibniz International Proceedings in Informatics, no. 105, vol. 105, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 151-1513, Annual Symposium on Combinatorial Pattern Matching, 1/01/18. https://doi.org/10.4230/LIPIcs.CPM.2018.15

Computing longest common square subsequences. / Inoue, T.; Inenaga, S.; Hyyrö, H. et al.
29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. ed. / Gonzalo Navarro; David Sankoff; Binhai Zhu. Vol. 105 Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. p. 151-1513 (Leibniz International Proceedings in Informatics; Vol. 105, No. 105).

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

TY - GEN

T1 - Computing longest common square subsequences

AU - Inoue, T.

AU - Inenaga, S.

AU - Hyyrö, H.

AU - Bannai, H.

AU - Takeda, M.

PY - 2018

Y1 - 2018

KW - Dynamic programming

KW - Matching rectangles

KW - Squares

KW - Subsequences

KW - Dynamic programming

KW - Matching rectangles

KW - Squares

KW - Subsequences

U2 - 10.4230/LIPIcs.CPM.2018.15

DO - 10.4230/LIPIcs.CPM.2018.15

M3 - Conference contribution

SN - 978-3-95977-074-3

VL - 105

T3 - Leibniz International Proceedings in Informatics

SP - 151

EP - 1513

BT - 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018

A2 - Navarro, Gonzalo

A2 - Sankoff, David

A2 - Zhu, Binhai

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

T2 - Annual Symposium on Combinatorial Pattern Matching

Y2 - 1 January 2018

ER -

Inoue T, Inenaga S, Hyyrö H, Bannai H, Takeda M. Computing longest common square subsequences. In Navarro G, Sankoff D, Zhu B, editors, 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. Vol. 105. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2018. p. 151-1513. (Leibniz International Proceedings in Informatics; 105). doi: 10.4230/LIPIcs.CPM.2018.15