Skip to main content
Journal Article

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) (2004) 3109 311-322
DOI: 10.1007/978-3-540-27801-6_23
19Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present new results concerning the problem of finding a constrained pattern in a set of 2-intervals. Given a set of n 2-intervals D and a model R describing if two disjoint 2-intervals can be in precedence order (

Cite

CITATION STYLE

APA

Blin, G., Fertin, G., & Vialette, S. (2004). 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), 3109, 311–322. https://doi.org/10.1007/978-3-540-27801-6_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free