New results for the 2-interval pattern problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3109, Issue , 2004, Pages 311-322

  Blin, Guillaume ^a   Fertin, Guillaume ^b   Vialette, Stéphane ^a  

^a UNIVERSITÉ DE NANTES   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BEST-KNOWN ALGORITHMS; CARDINALITIES; FIXED-PARAMETER TRACTABILITY; NEW RESULTS; NP COMPLETE; TIME ALGORITHMS; TIME COMPLEXITY;

PATTERN MATCHING;

EID: 35048893323     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_23     Document Type: Article

References (22)

1. [AGGN02] J. Alber, J. Gramm, J. Guo, and R. Niedermeier, Towards optimally solving the longest common subsequence problem for sequences with nested arc annotations in linear time, Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), Lecture Notes in Computer Science, vol. 2373, Springer-Verlag, 2002, pp. 99-114.
2. [BP93] J.R.S. Blair and B. Peyton, An introduction to chordal graphs and clique trees, Graph Theory and Sparse Matrix Computation 56 (1993), 1-29.
3. [BYHN+02] R. Bar-Yehuda, M.M. Halldorsson, J. Naor, H. Shachnai, and I. Shapira, Scheduling split intervals, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 732-741.
4. [DGP88] I. Dagan, M.C. Golumbic, and R.Y. Pinter, Trapezoid graphs and their coloring, Discrete Applied Mathematics 21 (1988), 35-46.
5. [Eva99] P. Evans, Finding common subsequences with arcs and pseudoknots, Proceedings of the 10th Annual Symposium Combinatorial Pattern Matching (CPM 1999), Lecture Notes in Computer Science, vol. 1645, Springer-Verlag, 1999, pp. 270-280.
6. [FG65] D.R. Fulkerson and O.A. Gross, Incidence matrices and interval graphs, Pacific Journal of Math. 15 (1965), 835-855.
7. [FMW97] S. Felsner, R. Müller, and L. Wernisch, Trapezoid graphs and generalizations: Geometry and algorithms, Discrete Applied Math. 74 (1997), 13-32.
8. [Fre75] M.L. Fredman, On computing the length of longest increasing subsequences, Disrete Mathematics 11 (1975), 29-35.
9. [GGN02] J. Gramm, J. Guo, and R. Niedermeier, Pattern matching for arcannotated sequences, Proceedings of the the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002), Lecture Notes in Computer Science, vol. 2556, 2002, pp. 182-193.
10. [GIP99] D. Goldman, S. Istrail, and C.H. Papadimitriou, Algorithmic aspects of protein structure similarity, Proceedings of the 40th Annual Symposium of Foundations of Computer Science (FOCS99), 1999, pp. 512-522.
11. [Gol80] M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
12. [GW79] J.R. Griggs and D.B. West, Extremal values of the interval number of a graph, I, SIAM J. Alg. Discrete Methods 1 (1979), 1-7.
13. [JLMZ00] T. Jiang, G.-H. Lin, B. Ma, and K. Zhang, The longest common subsequence problem for arc-annotated sequences, In Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000), Lecture Notes in Computer Science, vol. 1848, Springer-Verlag, 2000, pp. 154-165.
14. [JMT92] D. Joseph, J. Meidanis, and P. Tiwari, Determining DNA sequence similarity using maximum independent set algorithms for interval graphs, Proceedings of the Third Scandinavian Workshop on Algorithm Theory (SWAT 92), Lecture Notes in Computer Science, Springer-Verkag, 1992, pp. 326-337.
15. [MV80] S. Micali and V.V. Vazirani, An O(√|V||E|) algorithm for finding maximum matching in general graphs, Proceedings of the 21st Annual Symposium on Foundation of Computer Science, IEEE, 1980, pp. 17-27.
16. [TH79] W.T. Trotter and F. Harary, On double and multiple interval graphs, J. Graph Theory 3 (1979), 205-211.
17. [TY84] R.E. Tarjan and M Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput. 13 (1984), 566-579.
18. [Vaz94] V.V. Vazirani, A theory of alternating paths and blossoms for proving correctness of the O(√|V||E|) maximum matching algorithm, Combinatorica 14 (1994), no. 1, 71-109.
19. [VD01] J. Viksna and D.Gilbert, Pattern matching and pattern discovery algorithms for protein topologies, Lecture Notes in Computer Science, vol. 2149, Springer, 2001, pp. 98-111.
20. [Via02] S. Vialette, Pattern matching over 2-intervals sets, In Proc. 13th Annual Symposium Combinatorial Pattern Matching (CPM 2002), Lecture Notes in Computer Science, vol. 2373, Springer-Verlag, 2002, pp. 53-63.
21. [Via04] On the computational complexity of 2-interval pattern matching, Theoretical Computer Science 312 (2004), no. 2-3, 223-249.
22. [WS84] D.B. West and D.B. Shmoys, Recognizing graphs with fixed interval number is NP-complete, Discrete Applied Mathematics 8 (1984), 295-305.