Computing longest common square subsequences

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

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

    4 Citations (Scopus)
    Original languageEnglish
    Title of host publication29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018
    EditorsGonzalo Navarro, David Sankoff, Binhai Zhu
    Pages151-1513
    Volume105
    DOIs
    Publication statusPublished - 2018
    Publication typeA4 Article in a conference publication
    EventAnnual Symposium on Combinatorial Pattern Matching -
    Duration: 1 Jan 2018 → …

    Publication series

    NameLeibniz International Proceedings in Informatics
    Number105
    Volume105
    ISSN (Print)1868-8969

    Conference

    ConferenceAnnual Symposium on Combinatorial Pattern Matching
    Period1/01/18 → …

    Keywords

    • Dynamic programming
    • Matching rectangles
    • Squares
    • Subsequences

    Publication forum classification

    • Publication forum level 1

    Cite this