Sciweavers

    113 search results - page 5 / 23
    » Combinatorics of Periods in Strings
    Sort
    View
    CPM
    2010
    Springer
    209views Combinatorics» more  CPM 2010»
    Bidirectional Search in a String with Wavelet Trees
    15 years 2 months ago
    Bidirectional Search in a String with Wavelet Trees
    Download  cs.nyu.edu
    Thomas Schnattinger, Enno Ohlebusch, Simon Gog
    claim paper
    Read More »
    CPM
    2001
    Springer
    211views Combinatorics» more  CPM 2001»
    Fuzzy Hamming Distance: A New Dissimilarity Measure
    15 years 2 months ago
    Fuzzy Hamming Distance: A New Dissimilarity Measure
    Download  www.springer.com
    Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
    Abraham Bookstein, Shmuel T. Klein, Timo Raita
    claim paper
    Read More »
    COMBINATORICS
    2004
    103views more  COMBINATORICS 2004»
    On the Counting of Fully Packed Loop Configurations: Some New Conjectures
    14 years 9 months ago
    On the Counting of Fully Packed Loop Configurations: Some New Conjectures
    Download  www.combinatorics.org
    New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures a...
    Jean-Bernard Zuber
    claim paper
    Read More »
    GECCO
    2009
    Springer
    152views Optimization» more  GECCO 2009»
    A data-based coding of candidate strings in the closest string problem
    15 years 2 months ago
    A data-based coding of candidate strings in the closest string problem
    Download  web.stcloudstate.edu
    Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
    Bryant A. Julstrom
    claim paper
    Read More »
    COMBINATORICS
    2004
    90views more  COMBINATORICS 2004»
    Strings with Maximally Many Distinct Subsequences and Substrings
    14 years 9 months ago
    Strings with Maximally Many Distinct Subsequences and Substrings
    Download  www.combinatorics.org
    A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
    Abraham Flaxman, Aram Wettroth Harrow, Gregory B. ...
    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.