TY - JOUR

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

AU - Sakai, Yoshifumi

N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.

PY - 2009/6/28

Y1 - 2009/6/28

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

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

KW - Algorithms

KW - Longest common subsequence

KW - Topological sort

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

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

U2 - 10.1016/j.tcs.2009.03.027

DO - 10.1016/j.tcs.2009.03.027

M3 - Article

AN - SCOPUS:67349205038

VL - 410

SP - 2759

EP - 2766

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 27-29

ER -