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 | |
Publication status | Published - 2009 Jun 28 |
Keywords
- Algorithms
- Longest common subsequence
- Topological sort
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)