Sciweavers

    DIS
    2004
    Springer
    95views Theoretical Computer Science» more  DIS 2004»
    Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
    13 years 10 months ago
    Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance
    Download  www.i.kyushu-u.ac.jp
    We consider the problem of discovering the optimal pair of substring patterns with bounded distance α, from a given set S of strings. We study two kinds of pattern classes, one is...
    Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö,...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.