Approximating the 2-interval pattern problem

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

doi:10.1007/11561071_39

Approximating the 2-interval pattern problem

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

Department of Computer Science

Research output: Contribution to journal › Conference article › peer-review

Abstract

We address the problem of approximating the 2-INTERVAL PATTERN problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure prediction, asks to find a maximum cardinality subset of a 2-interval set with respect to some prespecified model. For each such model, we give varying approximation quality depending on the different possible restrictions imposed on the input 2-interval set.

Original language	English
Pages (from-to)	426-437
Number of pages	12
Journal	Lecture Notes in Computer Science
Volume	3669
DOIs	https://doi.org/10.1007/11561071_39
State	Published - 2005
Event	13th Annual European Symposium on Algorithms, ESA 2005 - Palma de Mallorca, Spain Duration: 3 Oct 2005 → 6 Oct 2005

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.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/11561071_39

Cite this

@article{4258fa51c12b4f07b8ca7ea3b7d20ab9,

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

abstract = "We address the problem of approximating the 2-INTERVAL PATTERN problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure prediction, asks to find a maximum cardinality subset of a 2-interval set with respect to some prespecified model. For each such model, we give varying approximation quality depending on the different possible restrictions imposed on the input 2-interval set.",

author = "Maxime Crochemore and Danny Hermelin and Landau, {Gad M.} 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.; 13th Annual European Symposium on Algorithms, ESA 2005 ; Conference date: 03-10-2005 Through 06-10-2005",

year = "2005",

doi = "10.1007/11561071_39",

language = "English",

volume = "3669",

pages = "426--437",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

}

TY - JOUR

T1 - Approximating the 2-interval pattern problem

AU - Crochemore, Maxime

AU - Hermelin, Danny

AU - Landau, Gad M.

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 - 2005

Y1 - 2005

N2 - We address the problem of approximating the 2-INTERVAL PATTERN problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure prediction, asks to find a maximum cardinality subset of a 2-interval set with respect to some prespecified model. For each such model, we give varying approximation quality depending on the different possible restrictions imposed on the input 2-interval set.

AB - We address the problem of approximating the 2-INTERVAL PATTERN problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure prediction, asks to find a maximum cardinality subset of a 2-interval set with respect to some prespecified model. For each such model, we give varying approximation quality depending on the different possible restrictions imposed on the input 2-interval set.

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

U2 - 10.1007/11561071_39

DO - 10.1007/11561071_39

M3 - Conference article

AN - SCOPUS:27144471879

SN - 0302-9743

VL - 3669

SP - 426

EP - 437

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 13th Annual European Symposium on Algorithms, ESA 2005

Y2 - 3 October 2005 through 6 October 2005

ER -

Approximating the 2-interval pattern problem

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this