Approximating the 2-interval pattern problem

Maxime Crochemore; Danny Hermelin; Gad M. Landau; Dror Rawitz; Stéphane Vialette

Approximating the 2-interval pattern problem

Maxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

We address the issue of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, motivated by RNA secondary structure prediction, asks to find a maximum cardinality subset of a 2-interval set with respect to some prespecified geometric constraints. We present several constant factor approximation algorithms whose performance guarantee depends on the different possible restrictions imposed on the input 2-interval set. In addition, we show that our results extend to the weighted variant of the problem.

Original language	English
Pages (from-to)	283-297
Number of pages	15
Journal	Theoretical Computer Science
Volume	395
Issue number	2-3
State	Published - 1 May 2008
Externally published	Yes

Bibliographical note

Funding Information:
The authors would like to express their gratitude to Martin C. Golumbic for the fruitful discussions and valuable remarks. The first author was partially supported by CNRS, France, and the French Ministry of Research through ACI NIM. The third author was partially supported by the Israel Science Foundation grant 35/05.

Funding

The authors would like to express their gratitude to Martin C. Golumbic for the fruitful discussions and valuable remarks. The first author was partially supported by CNRS, France, and the French Ministry of Research through ACI NIM. The third author was partially supported by the Israel Science Foundation grant 35/05.

Funders	Funder number
ACI NIM
French Ministry of Research
Israel Science Foundation	35/05
Centre National de la Recherche Scientifique

Keywords

2-interval
Combinatorial approximation algorithms
RNA secondary structure prediction

Cite this

@article{1520eb269a87404dab9b30910ad1a4a4,

title = "Approximating the 2-interval pattern problem",

abstract = "We address the issue of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, motivated by RNA secondary structure prediction, asks to find a maximum cardinality subset of a 2-interval set with respect to some prespecified geometric constraints. We present several constant factor approximation algorithms whose performance guarantee depends on the different possible restrictions imposed on the input 2-interval set. In addition, we show that our results extend to the weighted variant of the problem.",

keywords = "2-interval, Combinatorial approximation algorithms, RNA secondary structure prediction",

author = "Maxime Crochemore and Danny Hermelin and Landau, {Gad M.} and Dror Rawitz and St{\'e}phane Vialette",

note = "Funding Information: The authors would like to express their gratitude to Martin C. Golumbic for the fruitful discussions and valuable remarks. The first author was partially supported by CNRS, France, and the French Ministry of Research through ACI NIM. The third author was partially supported by the Israel Science Foundation grant 35/05.",

year = "2008",

month = may,

day = "1",

language = "אנגלית",

volume = "395",

pages = "283--297",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "2-3",

}

TY - JOUR

T1 - Approximating the 2-interval pattern problem

AU - Crochemore, Maxime

AU - Hermelin, Danny

AU - Landau, Gad M.

AU - Rawitz, Dror

AU - Vialette, Stéphane

N1 - Funding Information: The authors would like to express their gratitude to Martin C. Golumbic for the fruitful discussions and valuable remarks. The first author was partially supported by CNRS, France, and the French Ministry of Research through ACI NIM. The third author was partially supported by the Israel Science Foundation grant 35/05.

PY - 2008/5/1

Y1 - 2008/5/1

N2 - We address the issue of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, motivated by RNA secondary structure prediction, asks to find a maximum cardinality subset of a 2-interval set with respect to some prespecified geometric constraints. We present several constant factor approximation algorithms whose performance guarantee depends on the different possible restrictions imposed on the input 2-interval set. In addition, we show that our results extend to the weighted variant of the problem.

AB - We address the issue of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, motivated by RNA secondary structure prediction, asks to find a maximum cardinality subset of a 2-interval set with respect to some prespecified geometric constraints. We present several constant factor approximation algorithms whose performance guarantee depends on the different possible restrictions imposed on the input 2-interval set. In addition, we show that our results extend to the weighted variant of the problem.

KW - 2-interval

KW - Combinatorial approximation algorithms

KW - RNA secondary structure prediction

UR - http://www.scopus.com/inward/record.url?scp=45749105485&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:45749105485

SN - 0304-3975

VL - 395

SP - 283

EP - 297

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 2-3

ER -

Approximating the 2-interval pattern problem

Abstract

Bibliographical note

Funding

Keywords

Other files and links

Fingerprint

Cite this