Repetition-free longest common subsequence

Electronic Notes in Discrete Mathematics

Volumn 30, Issue C, 2008, Pages 243-248

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

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

Author keywords

approximation algorithms; APX hard; Longest common subsequence

Indexed keywords

EID: 39349095149     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2008.01.042     Document Type: Article

References (6)

1. 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
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. Bonizzoni P., Della Vedova G., Dondi R., Fertin G., and Vialette S. Exemplar longest common subsequence. Proceedings of ICCS. Lecture Notes in Computer Science volume 3992 (2006), Springer 622-629
4. Bryant D. The complexity of calculating exemplar distances. In: Sankoff D., and Nadeau J.H. (Eds). Comparative Genomics (2001), Kluwer 207-212
5. Papadimitriou C.H., and Yannakakis M. Optimization, approximation and complexity classes. Journal of Computer and System Sciences 43 (1991) 425-440
6. Sankoff D. Genome rearrangement with gene families. Bioinformatics 15 11 (1999) 909-917