Repetition-free longest common subsequence-Reference-Cited by-同舟云学术

Repetition-free longest common subsequence

Published:2008-02 Issue: Volume:30 Page:243-248
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Adi S.S.,Braga M.D.V.,Fernandes C.G.,Ferreira C.E.,Martinez F.V.,Sagot M.-F.,Stefanes M.A.,Tjandraatmadja C.,Wakabayashi Y.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference6 articles.

1. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999

2. G. Blin, G. Fertin, and C. Chauve. The breakpoint distance for signed sequences. In Proceedings of CompBioNets - Text in Algorithms, volume 3, pages 3–16, 2004

3. Exemplar longest common subsequence;Bonizzoni,2006

4. The complexity of calculating exemplar distances;Bryant,2001

5. Optimization, approximation and complexity classes;Papadimitriou;Journal of Computer and System Sciences,1991

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial-time equivalences and refined algorithms for longest common subsequence variants;Discrete Applied Mathematics;2024-08

2. Parallel Solution to LIS Using Divide-and-Conquer Approach;Data Science and Analytics;2020

3. A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem;Journal of Heuristics;2017-04-06

4. Bibliography;Metaheuristics for String Problems in Bio-Informatics;2016-09-16

5. Variants of constrained longest common subsequence;Information Processing Letters;2010-09