Sciweavers

    77
    Voted
    CPM
    2007
    Springer
    134views Combinatorics» more  CPM 2007»
    Efficient Computation of Substring Equivalence Classes with Suffix Arrays
    15 years 1 months ago
    Efficient Computation of Substring Equivalence Classes with Suffix Arrays
    Download  www.i.kyushu-u.ac.jp
    This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
    Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
    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-2025, USA.