Sciweavers

    CPM
    2008
    Springer
    133views Combinatorics» more  CPM 2008»
    HP Distance Via Double Cut and Join Distance
    13 years 6 months ago
    HP Distance Via Double Cut and Join Distance
    Download  www.cs.ucr.edu
    Anne Bergeron, Julia Mixtacki, Jens Stoye
    claim paper
    Read More »
    CPM
    2008
    Springer
    117views Combinatorics» more  CPM 2008»
    Dynamic Fully-Compressed Suffix Trees
    13 years 6 months ago
    Dynamic Fully-Compressed Suffix Trees
    Download  www.cs.ucr.edu
    Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
    claim paper
    Read More »
    CPM
    2008
    Springer
    154views Combinatorics» more  CPM 2008»
    Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
    13 years 6 months ago
    Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots
    Download  www.bioinf.uni-freiburg.de
    We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
    Mathias Möhl, Sebastian Will, Rolf Backofen
    claim paper
    Read More »
    CPM
    2008
    Springer
    107views Combinatorics» more  CPM 2008»
    Towards a Solution to the "Runs" Conjecture
    13 years 6 months ago
    Towards a Solution to the "Runs" Conjecture
    Download  www.cs.ucr.edu
    Maxime Crochemore, Lucian Ilie, Liviu Tinta
    claim paper
    Read More »
    CPM
    2008
    Springer
    105views Combinatorics» more  CPM 2008»
    Matching Integer Intervals by Minimal Sets of Binary Words with don't cares
    13 years 6 months ago
    Matching Integer Intervals by Minimal Sets of Binary Words with don't cares
    Download  www.cs.ucr.edu
    Wojciech Fraczak, Wojciech Rytter, Mohammadreza Ya...
    claim paper
    Read More »
    CPM
    2008
    Springer
    170views Combinatorics» more  CPM 2008»
    Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
    13 years 6 months ago
    Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
    Download  www.cs.ucr.edu
    Nadja Betzler, Michael R. Fellows, Christian Komus...
    claim paper
    Read More »
    CPM
    2008
    Springer
    119views Combinatorics» more  CPM 2008»
    The Changing Face of Web Search
    13 years 6 months ago
    The Changing Face of Web Search
    Download  www.stanford.edu
    Prabhakar Raghavan
    claim paper
    Read More »
    CPM
    2008
    Springer
    134views Combinatorics» more  CPM 2008»
    An Improved Succinct Representation for Dynamic k-ary Trees
    13 years 6 months ago
    An Improved Succinct Representation for Dynamic k-ary Trees
    Download  www.dcc.uchile.cl
    Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
    Diego Arroyuelo
    claim paper
    Read More »
    « first‹ previous12
    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.