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

Authors:
Yoshifumi Sakai
Affiliations:
Graduate School of Agricultural Science, Tohoku University, Sendai 981-8555, Japan
Venue:
Theoretical Computer Science
Year:
2009

Citing 9
Cited 0

Improving the worst-case performance of the Hunt-Szymanski strategy for the longest common subsequence of two strings

Information Processing Letters
Introduction to algorithms

Introduction to algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
A fast algorithm for computing longest common subsequences

Communications of the ACM
A linear space algorithm for computing maximal common subsequences

Communications of the ACM
Multiple Alignment of Biological Sequences with Gap Flexibility

LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
A simple algorithm for the constrained sequence problems

Information Processing Letters
An almost-linear time and linear space algorithm for the longest common subsequence problem

Information Processing Letters
Semi-local longest common subsequences in subquadratic time

Journal of Discrete Algorithms

Quantified Score

Hi-index	5.23

Visualization

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.