Publicação

The longest filled common subsequence problem

Ver documento

Detalhes bibliográficos
Resumo:Inspired by a recent approach for genome reconstruction from incomplete data, we consider a variant of the longest common subsequence problem for the comparison of two sequences, one of which is incomplete, i.e. it has some missing elements. The new combinatorial problem, called Longest Filled Common Subsequence, given two sequences A and B, and a multiset M of symbols missing in B, asks for a sequence B∗ obtained by inserting the symbols of M into B so that B∗ induces a common subsequence with A of maximum length. First, we investigate the computational and approximation complexity of the problem and we show that it is NP-hard and APX-hard when A contains at most two occurrences of each symbol. Then, we give a 3/5-approximation algorithm for the problem. Finally, we present a fixed-parameter algorithm, when the problem is parameterized by the number of symbols inserted in B that "match" symbols of A.
Autores principais:Castelli, Mauro
Outros Autores:Dondi, Riccardo; Mauri, Giancarlo; Zoppis, Italo
Assunto:Approximation algorithms Computational complexity Fixed-parameter algorithms Longest common subsequence Software
Ano:2017
País:Portugal
Tipo de documento:documento de conferência
Tipo de acesso:acesso aberto
Instituição associada:Universidade Nova de Lisboa
Idioma:inglês
Origem:Repositório Institucional da UNL

Registos relacionados

Registos relacionados