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

研究成果: Article

抜粋

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.

元の言語English
ページ(範囲)2759-2766
ページ数8
ジャーナルTheoretical Computer Science
410
発行部数27-29
DOI
出版物ステータスPublished - 2009 6 28

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用