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

Yoshifumi Sakai

doi:10.1016/j.tcs.2009.03.027

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

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	2759-2766
Number of pages	8
Journal	Theoretical Computer Science
Volume	410
Issue number	27-29
DOIs	https://doi.org/10.1016/j.tcs.2009.03.027
Publication status	Published - 2009 Jun 28

Keywords

Algorithms
Longest common subsequence
Topological sort

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/j.tcs.2009.03.027

Cite this

@article{40cd9476c50146d8afaef439021161e5,

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

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.",

keywords = "Algorithms, Longest common subsequence, Topological sort",

author = "Yoshifumi Sakai",

year = "2009",

month = jun,

day = "28",

doi = "10.1016/j.tcs.2009.03.027",

language = "English",

volume = "410",

pages = "2759--2766",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "27-29",

}

TY - JOUR

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

AU - Sakai, Yoshifumi

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 -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this