Sciweavers

    RECOMB
    2004
    Springer
    124views Computational Biology» more  RECOMB 2004»

    From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles

    15 years 11 months ago
    From profiles to patterns and back again: a branch and bound algorithm for finding near optimal motif profiles
    Download  cseweb.ucsd.edu
    Eleazar Eskin
    claim paper
    Added 03 Dec 2009
    Updated 03 Dec 2009
    Type Conference
    Year 2004
    Where RECOMB
    Authors Eleazar Eskin
    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-2025, USA.