Hardness and Approximability of the Inverse Scope Problem

Z. Nikoloski, S. Grimbs, J. Selbig, Oliver Ebenhoeh

Research output: Chapter in Book/Report/Conference proceedingChapter

8 Citations (Scopus)
Original languageEnglish
Title of host publicationAlgorithms in Bioinformatics
Subtitle of host publicationProceedings of the 8th International Workshop, WABI 2008
EditorsKeith A. Crandall, Jens Lagergren
Place of PublicationBerlin, Germany
PublisherSpringer Science+Business Media
Pages99-112
Volume5251
ISBN (Print)3540873600, 978-3540873600
DOIs
Publication statusPublished - 10 Sep 2008
Event8th International Workshop, WABI 2008 - Karlsruhe, Germany
Duration: 15 Sep 200819 Sep 2008

Publication series

NameLecture Notes in Computer Science/Lecture Notes in Bioinformatics
PublisherSpringer Science+Business Media
Number5251
ISSN (Print)0302-9743

Conference

Conference8th International Workshop, WABI 2008
CountryGermany
CityKarlsruhe
Period15/09/0819/09/08

Cite this

Nikoloski, Z., Grimbs, S., Selbig, J., & Ebenhoeh, O. (2008). Hardness and Approximability of the Inverse Scope Problem. In K. A. Crandall, & J. Lagergren (Eds.), Algorithms in Bioinformatics: Proceedings of the 8th International Workshop, WABI 2008 (Vol. 5251, pp. 99-112). (Lecture Notes in Computer Science/Lecture Notes in Bioinformatics; No. 5251). Springer Science+Business Media. https://doi.org/10.1007/978-3-540-87361-7