Some Approximations for Shortest Common Nonsubsequences and Supersequences

Authors:
Vadim G. Timkovsky
Affiliations:
Faculty of Economics and Business, The University of Sydney, Australia NSW 2006
Venue:
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Year:
2008

Citing 11
Cited 2

Multiple alignment, communication cost, and graph matching

SIAM Journal on Applied Mathematics
The shortest common nonsubsequence problem is NP-complete

Theoretical Computer Science
Approximation algorithms for multiple sequence alignment

Theoretical Computer Science
String Noninclusion Optimization Problems

SIAM Journal on Discrete Mathematics
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
An approximation algorithm for the shortest common supersequence problem: an experimental analysis

Proceedings of the 2001 ACM symposium on Applied computing
Approximation algorithms for the shortest common supersequence

Nordic Journal of Computing
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice
Memetic algorithms with partial lamarckism for the shortest common supersequence problem

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
A comparison of evolutionary approaches to the shortest common supersequence problem

IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems

Improved Approximation Results on the Shortest Common Supersequence Problem

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Restricted common superstring and restricted common supersequence

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is devoted to polynomial-time approximations for the problems of finding a shortest common nonsubsequence and a shortest common supersequence of given strings. The main attention is paid to the special case of the latter problem where all given strings are of length two. We show strong connections of this case to the feedback vertex set problem, the maximal network flow problem and the maximal multi-commodity network flow problem.