Approximating the 2-interval pattern problem

Theoretical Computer Science

Volumn 395, Issue 2-3, 2008, Pages 283-297

  Crochemore, Maxime ^a,b   Hermelin, Danny ^c   Landau, Gad M ^c,d   Rawitz, Dror ^c   Vialette, Stéphane ^e  

^a Université de Marne la Vallée   (France)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF HAIFA   (Israel)

^d POLYTECHNIC UNIVERSITY   (United States)

^e UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

2 interval; Combinatorial approximation algorithms; RNA secondary structure prediction

Indexed keywords

BIOINFORMATICS; RNA;

2-INTERVAL; CARDINALITIES; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; GEOMETRIC CONSTRAINT; PERFORMANCE GUARANTEES; RNA SECONDARY STRUCTURE PREDICTION;

APPROXIMATION ALGORITHMS;

EID: 45749105485     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.01.007     Document Type: Article

References (21)

1. Akutsu T. Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. Discrete Applied Mathematics 104 (2000) 45-62
2. Bar-Noy A., Bar-Yehuda R., Freund A., Naor J., and Shieber B. A unified approach to approximating resource allocation and schedualing. Journal of the ACM 48 5 (2001) 1069-1090
3. Bar-Yehuda R. One for the price of two: A unified approach for approximating covering problems. Algorithmica 27 2 (2000) 131-144
4. Bar-Yehuda R., and Even S. A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics 25 (1985) 27-46
5. R. Bar-Yehuda, M.M. Halldorsson, J. Naor, H. Shachnai, I. Shapira, Scheduling split intervals, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, pp. 732-741
6. G. Blin, G. Fertin, S. Vialette, New results for the 2-interval pattern problem, in: Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004, pp. 311-322
7. Dagan I., Golumbic M.C., and Pinter R.Y. Trapezoid graphs and their coloring. Discrete Applied Mathematics 21 (1988) 35-46
8. P. Evans, Finding common subsequences with arcs and pseudoknots, in: Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching, CPM 1999, pp. 270-280
9. Felsner S., Müller R., and Wernisch L. Trapezoid graphs and generalizations: Geometry and algorithms. Discrete Applied Mathematics 74 (1997) 13-32
10. Gavril F. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing 1 (1972) 180-187
11. D. Goldman, S. Istrail, C.H. Papadimitriou, Algorithmic aspects of protein structure similarity, in: Proceedings of the 40th Annual Symposium of Foundations of Computer Science, FOCS 1999, pp. 512-522
12. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press, New York
13. J. Gramm, J. Guo, R. Niedermeier, Pattern matching for arc-annotated sequences, in: Proceedings of the 22th Conference on Foundations of Software Technology and Theoretical Computer Science, FCTTSC 1999, pp. 182-193
14. Griggs J.R., and West D.B. Extremal values of the interval number of a graph. SIAM Journal of Algebraic and Discrete Methods 1 (1979) 1-7
15. S. Ieong, M.Y. Kao, T.W. Lam, W.K. Sung, S.M. Yiu, Predicting RNA secondary structures with arbitrary pseudoknots by maximizing the number of stacking pairs, in: Proceedings of the 2nd Symposium on Bioinformatics and Bioengineering, BIBE 2002, pp. 183-190
16. Lyngsø R.B., and Pedersen C.N.S. RNA pseudoknot prediction in energy based models. Journal of Computational Biology 7 (2000) 409-428
17. McKee T.A., and McMorris F.R. Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications (1999)
18. Moore P.B. Structural motifs in RNA. Annual Review of Biochemistry 68 (1999) 287-300
19. Trotter W.T., and Harary F. On double and multiple interval graphs. Journal of Graph Theory 3 (1979) 205-211
20. Vialette S. On the computational complexity of 2-interval pattern matching problems. Theoretical Computer Science 312 (2004) 335-379
21. Waterman M.S. Introduction to Computational Biology. Maps, Sequences and Genomes (1995), Chapman and Hall, London