Computing the longest common subsequence of two run-length encoded strings

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Citations (Scopus)

    Abstract

    The present article reveals that the problem of finding the longest common subsequence of two strings given in run-length encoded form can be solved in O(mnlog log min(m, n, M/m, N/n, X)) time, where one input string is of length M with m runs, the other is of length N with n runs, and X is the average difference between the length of a run from one input string and that of a run from the other.

    Original languageEnglish
    Title of host publicationAlgorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings
    PublisherSpringer Verlag
    Pages197-206
    Number of pages10
    ISBN (Print)9783642352607
    DOIs
    Publication statusPublished - 2012
    Event23rd International Symposium on Algorithms and Computation, ISAAC 2012 - Taipei, Taiwan, Province of China
    Duration: 2012 Dec 192012 Dec 21

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume7676 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other23rd International Symposium on Algorithms and Computation, ISAAC 2012
    Country/TerritoryTaiwan, Province of China
    CityTaipei
    Period12/12/1912/12/21

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint

    Dive into the research topics of 'Computing the longest common subsequence of two run-length encoded strings'. Together they form a unique fingerprint.

    Cite this