Computing longest common substring/subsequence of non-linear texts

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 - 2011
EventPrague Stringology Conference 2011, PSC 2011 - Prague, Czech Republic
Duration: Aug 29 2011Aug 31 2011

Other

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

Fingerprint

Longest Common Subsequence
Computing
Directed Graph
Arc of a curve
Strings
Denote
Text
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

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)

Computing longest common substring/subsequence of non-linear texts. / Shimohira, Kouji; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

Proceedings of the Prague Stringology Conference 2011. 2011. p. 197-208.

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

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, Prague Stringology Conference 2011, PSC 2011, Prague, Czech Republic, 8/29/11.
Shimohira K, Inenaga S, Bannai H, Takeda M. Computing longest common substring/subsequence of non-linear texts. In Proceedings of the Prague Stringology Conference 2011. 2011. p. 197-208
Shimohira, Kouji ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Computing longest common substring/subsequence of non-linear texts. Proceedings of the Prague Stringology Conference 2011. 2011. pp. 197-208
@inproceedings{6d5b91997ebd4075aa29acb3dca28d4e,
title = "Computing longest common substring/subsequence of non-linear texts",
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.",
author = "Kouji Shimohira and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2011",
language = "English",
isbn = "9788001048702",
pages = "197--208",
booktitle = "Proceedings of the Prague Stringology Conference 2011",

}

TY - GEN

T1 - Computing longest common substring/subsequence of non-linear texts

AU - Shimohira, Kouji

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84869117991&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84869117991&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9788001048702

SP - 197

EP - 208

BT - Proceedings of the Prague Stringology Conference 2011

ER -