Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A computational model for RNA multiple structural alignment
Theoretical Computer Science
Finding common structured patterns in linear graphs
Theoretical Computer Science
Parameterized algorithms for inclusion of linear matchings
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 5.23 |
The 2-interval pattern problem, introduced in [Stephane Vialette, On the computational complexity of 2-interval pattern matching problems Theoret. Comput. Sci. 312 (2-3) (2004) 223-249], models general problems with biological structures such as protein contact maps and macroscopic describers of secondary structures of ribonucleic acids. Given a set of 2-intervals D and a model R, the problem is to find a maximum cardinality subset D^' of D such that any two 2-intervals in D^' satisfy R, where R is a subset of relations on disjoint 2-intervals: precedence (