Sciweavers

    126
    Voted
    FCT
    2003
    Springer
    127views Applied Computing» more  FCT 2003»
    On Exact and Approximation Algorithms for Distinguishing Substring Selection
    15 years 8 months ago
    On Exact and Approximation Algorithms for Distinguishing Substring Selection
    Download  theinf1.informatik.uni-jena.de
    Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
    Jens Gramm, Jiong Guo, Rolf Niedermeier
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.