Trapezoid graphs and their coloring
Discrete Applied Mathematics
Introduction to algorithms
Trapezoid graphs and generalizations, geometry and algorithms
Discrete Applied Mathematics
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Pattern Matching for Arc-Annotated Sequences
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Pattern Matching Problems over 2-Interval Sets
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Algorithmic Aspects of Protein Structure Similarity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the computational complexity of 2-interval pattern matching problems
Theoretical Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Optimization problems in multiple-interval graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Approximating the 2-interval pattern problem
Theoretical Computer Science
On the complexity of the crossing contact map pattern matching problem
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
On Recovering Syntenic Blocks from Comparative Maps
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On the parameterized complexity of multiple-interval graph problems
Theoretical Computer Science
On the Tractability of Maximal Strip Recovery
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Finding common structured patterns in linear graphs
Theoretical Computer Science
Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
| Hi-index | 5.23 |
2-interval sets were used in [S. Vialette, Pattern matching over 2-intervals sets, in: Proc. 13th Annual Symposium Combinatorial Pattern Matching, CPM 2002, in: Lecture Notes in Computer Science, vol. 2373, Springer-Verlag, 2002, pp. 53-63; S. Vialette, On the computational complexity of 2-interval pattern matching, Theoret. Comput. Sci. 312 (2-3) (2004) 223-249] for establishing a general representation for macroscopic describers of RNA secondary structures. In this context, we have a 2-interval for each legal local fold in a given RNA sequence, and a constrained pattern made of disjoint 2-intervals represents a putative RNA secondary structure. We focus here on the problem of extracting a constrained pattern in a set of 2-intervals. More precisely, given a set of 2-intervals and a model R describing if two disjoint 2-intervals in a solution can be in precedence order () and/or be allowed to cross (), we consider the problem of finding a maximum cardinality subset of disjoint 2-intervals such that any two 2-intervals in agree with R. The different combinations of restrictions on model R alter the computational complexity of the problem, and need to be examined separately. In this paper, we improve the time complexity of [S. Vialette, On the computational complexity of 2-interval pattern matching, Theoret. Comput. Sci. 312 (2-3) (2004) 223-249] for model R={} by giving an optimal O(nlogn) time algorithm, where n is the cardinality of the 2-interval set . We also give a graph-like relaxation for model R={,} that is solvable in time. Finally, we prove that the considered problem is NP-complete for model R={} even for same-length intervals, and give a fixed-parameter tractability result based on the crossing structure of .