Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence

Research output: Contribution to journalArticle

Abstract

Let G be a directed acyclic graph, each vertex of which is labeled with a symbol, and having, for any such symbol, a path in which all of the vertices labeled with the symbol appear with vertices labeled with other symbols. Let B be a sequence of symbols. This article proposes a polynomial-time algorithm for computing one of the longest possible common subsequences of a sequence specified by any topological sort of G and the sequence B.

Original languageEnglish
Pages (from-to)2759-2766
Number of pages8
JournalTheoretical Computer Science
Volume410
Issue number27-29
DOIs
Publication statusPublished - 2009 Jun 28

Keywords

  • Algorithms
  • Longest common subsequence
  • Topological sort

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence'. Together they form a unique fingerprint.

  • Cite this