On the approximation of finding various minimal, maximal, and consistent sequences

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we investigate the complexity of finding various kinds of common super-and subsequences with respect to one or two given sets of strings. We show how these problems can be related to finding sequences having a fixed character composition. This leads to a unified approach for characterizing the complexity of such problems. Moreover, we derive interesting results on the approximability of problems which are dual to the well known Shortest Common Supersequence and Longest Common Subsequence problems.

Cite

CITATION STYLE

APA

Middendorf, M. (1994). On the approximation of finding various minimal, maximal, and consistent sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 306–314). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_194

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free