Sciweavers

    ISMB
    2001
    63views Computational Biology» more  ISMB 2001»

    An efficient algorithm for finding short approximate non-tandem repeats

    14 years 1 months ago
    An efficient algorithm for finding short approximate non-tandem repeats
    Download  www.covenantuniversity.com
    Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann
    claim paper
    Added 31 Oct 2010
    Updated 31 Oct 2010
    Type Conference
    Year 2001
    Where ISMB
    Authors Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann
    Comments (0)
    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.