Repetition-free longest common subsequence of random sequences

DOI10.1016/j.dam.2015.07.005zbMath1339.05004arXiv1305.4883OpenAlexW1867483677MaRDI QIDQ299053

Cristina G. Fernandes, Marcos A. Kiwi

Publication date: 22 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.4883

zbMATH Keywords

random sequencescommon subsequencerepetition-free subsequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Special sequences and polynomials (11B83)

Related Items (1)

Exact algorithms for the repetition-bounded longest common subsequence problem

Cites Work

• Unnamed Item
• Unnamed Item
• Variants of constrained longest common subsequence
• On the parameterized complexity of the repetition free longest common subsequence problem
• A hybrid genetic algorithm for the repetition free longest common subsequence problem
• Expected length of the longest common subsequence for large alphabets
• A branch-and-cut approach to the repetition-free longest common subsequence problem
• A spectral heuristic for bisecting random graphs
• On the Approximability of Comparing Genomes with Duplicates
• On the distribution of the length of the longest increasing subsequence of random permutations
• Repetition-free longest common subsequence

This page was built for publication: Repetition-free longest common subsequence of random sequences