Sciweavers

    JCSS
    2002
    95views more  JCSS 2002»
    Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
    14 years 4 months ago
    Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
    Download  www.csie.ntu.edu.tw
    We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
    Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
    claim paper
    Read More »
    CORR
    2002
    Springer
    78views Education» more  CORR 2002»
    Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications
    14 years 4 months ago
    Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications
    Download  www.csie.ntu.edu.tw
    an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
    Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
    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.