Repetition-free longest common subsequence

Discrete Applied Mathematics

Volumn 158, Issue 12, 2010, Pages 1315-1324

  Adi, Said S ^a   Braga, Marília D V ^b   Fernandes, Cristina G ^c   Ferreira, Carlos E ^c   Martinez, Fábio Viduani ^a   Sagot, Marie France ^b   Stefanes, Marco A ^a   Tjandraatmadja, Christian ^c   Wakabayashi, Yoshiko ^c  

^a FEDERAL UNIVERSITY OF MATO GROSSO DO SUL   (Brazil)

^b UNIVERSITÉ LYON 1   (France)

^c UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Approximation algorithms; APX hardness; Longest common subsequence

Indexed keywords

APX-HARDNESS; EXPERIMENTAL STUDIES; FINITE ALPHABET; FOLLOWING PROBLEM; LONGEST COMMON SUBSEQUENCE; LONGEST COMMON SUBSEQUENCES;

COMPUTATIONAL COMPLEXITY; HARDNESS; PARALLEL PROCESSING SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 77953129192     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2009.04.023     Document Type: Article

References (11)

1. Adi S.S., Braga M.D.V., Fernandes C.G., Ferreira C.E., Martinez F.V., Sagot M.-F., Stefanes M.A., Tjandraatmadja C., and Wakabayashi Y. Repetition-free longest common subsequence. Proceedings of the IV Latin-American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discrete Math. vol. 30 (2008) 243-248 (electronic)
2. Alon N., and Spencer J. The Probabilistic Method (1992), John Wiley
3. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (1999), Springer
4. Blin G., Fertin G., and Chauve C. The breakpoint distance for signed sequences. Proceedings of CompBioNets - Text in Algorithms vol. 3 (2004) 3-16
5. Bonizzoni P., Della Vedova G., Dondi R., Fertin G., and Vialette S. Exemplar longest common subsequence. Proceedings of IWBRA. Lecture Notes in Computer Science vol. 3992 (2006), Springer, Berlin 622-629
6. Bryant D. The complexity of calculating exemplar distances. In: Sankoff D., and Nadeau J.H. (Eds). Comparative Genomics (2001), Kluwer 207-212
7. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. 2nd edition (2001), MIT Press
8. Fernandes C.G., Ferreira C.E., Tjandraatmadja C., and Wakabayashi Y. A polyhedral investigation of the LCS problem and a repetition-free variant. LATIN 2008: Theoretical Informatics. Lecture Notes in Computer Science vol. 4957 (2008), Springer, Berlin 329-338
9. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
10. Papadimitriou C.H., and Yannakakis M. Optimization, approximation and complexity classes. Journal of Computer and System Sciences 43 (1991) 425-440
11. Sankoff D. Genome rearrangement with gene families. Bioinformatics 15 11 (1999) 909-917