Repetition-free longest common subsequence

Authors:
Said S. Adi;Marília D. V. Braga;Cristina G. Fernandes;Carlos E. Ferreira;Fábio Viduani Martinez;Marie-France Sagot;Marco A. Stefanes;Christian Tjandraatmadja;Yoshiko Wakabayashi
Affiliations:
Universidade Federal do Mato Grosso do Sul, Brazil;Université Claude Bernard, Lyon I, France;Universidade de São Paulo, Brazil;Universidade de São Paulo, Brazil;Universidade Federal do Mato Grosso do Sul, Brazil;Université Claude Bernard, Lyon I, France;Universidade Federal do Mato Grosso do Sul, Brazil;Universidade de São Paulo, Brazil;Universidade de São Paulo, Brazil
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 5
Cited 5

Randomized algorithms

Randomized algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Introduction to Algorithms

Introduction to Algorithms
A polyhedral investigation of the LCS problem and a repetition-free variant

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Exemplar longest common subsequence

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II

The zero exemplar distance problem

RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
On the parameterized complexity of the repetition free longest common subsequence problem

Information Processing Letters
Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited

Information Processing Letters
Efficient algorithms for the longest common subsequence problem with sequential substring constraints

Journal of Complexity
The constrained shortest common supersequence problem

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.04

Visualization

Abstract

We study the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. We show several algorithmic results, a computational complexity result, and we describe a preliminary experimental study based on the proposed algorithms. We also show that this problem is APX-hard.