Repetition-free longest common subsequence

14 years 11 months ago

Download www.ime.usp.br

We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a complexity result, and we describe a preliminary experimental study based on the proposed algorithms.

Said Sadique Adi, Marília D. V. Braga, Cris

Real-time Traffic

ENDM 2008 | Finite Alphabet | Longest Common Subsequence | Sequences |

claim paper

» TimeWarped Longest Common Subsequence Algorithm for Music Retrieval

» Constrained Longest Common Subsequence Computing Algorithms in Practice

» Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs

» A genetic algorithm for the longest common subsequence problem

» Analysis of evolutionary algorithms for the longest common subsequence problem

» A New Efficient Algorithm for Computing the Longest Common Subsequence

» Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input...

» A BSPCGM Algorithm for the AllSubstrings Longest Common Subsequence Problem

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ENDM
Authors	Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco A. Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi

Comments (0)

Sciweavers

Repetition-free longest common subsequence

ENDM 2008 | Finite Alphabet | Longest Common Subsequence | Sequences |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers