Computing longest common substring/subsequence of non-linear texts

Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

Abstract

A non-linear text is a directed graph where each vertex is labeled with a string. In this paper, we introduce the longest common substring/subsequence problems on non-linear texts. Firstly, we present an algorithm to compute the longest common substring of non-linear texts G 1 and G 2 in O(|E 1||E 2|) time and O(|V 1||V 2|) space, when at least one of G 1 and G 2 is acyclic. Here, V i and E i are the sets of vertices and arcs of input non-linear text G i, respectively, for 1≤i≤2. Secondly, we present algorithms to compute the longest common subsequence of G 1 and G 2 in O(|E 1||E 2|) time and O(|V 1||V 2|) space, when both G 1 and G 2 are acyclic, and in O(|E 1||E 2|+|V 1||V 2| log |Σ|) time and O(|V 1||V 2|) space if G 1 and/or G 2 are cyclic, where, Σ denotes the alphabet.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2011
Pages197-208
Number of pages12
Publication statusPublished - Dec 1 2011
EventPrague Stringology Conference 2011, PSC 2011 - Prague, Czech Republic
Duration: Aug 29 2011Aug 31 2011

Publication series

NameProceedings of the Prague Stringology Conference 2011

Other

OtherPrague Stringology Conference 2011, PSC 2011
CountryCzech Republic
CityPrague
Period8/29/118/31/11

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Computing longest common substring/subsequence of non-linear texts'. Together they form a unique fingerprint.

  • Cite this

    Shimohira, K., Inenaga, S., Bannai, H., & Takeda, M. (2011). Computing longest common substring/subsequence of non-linear texts. In Proceedings of the Prague Stringology Conference 2011 (pp. 197-208). (Proceedings of the Prague Stringology Conference 2011).