### 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 language | English |
---|---|

Title of host publication | Proceedings of the Prague Stringology Conference 2011 |

Pages | 197-208 |

Number of pages | 12 |

Publication status | Published - Dec 1 2011 |

Event | Prague Stringology Conference 2011, PSC 2011 - Prague, Czech Republic Duration: Aug 29 2011 → Aug 31 2011 |

### Publication series

Name | Proceedings of the Prague Stringology Conference 2011 |
---|

### Other

Other | Prague Stringology Conference 2011, PSC 2011 |
---|---|

Country | Czech Republic |

City | Prague |

Period | 8/29/11 → 8/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

*Proceedings of the Prague Stringology Conference 2011*(pp. 197-208). (Proceedings of the Prague Stringology Conference 2011).