Sciweavers

    678 search results - page 66 / 136
    » On Complexity Measures for Biological Sequences
    Sort
    View
    BMCBI
    2004
    151views more  BMCBI 2004»
    A computational approach for ordering signal transduction pathway components from genomics and proteomics Data
    14 years 11 months ago
    A computational approach for ordering signal transduction pathway components from genomics and proteomics Data
    Download  www.biomedcentral.com
    Background: Signal transduction is one of the most important biological processes by which cells convert an external signal into a response. Novel computational approaches to mapp...
    Yin Liu, Hongyu Zhao
    claim paper
    Read More »
    FCT
    2005
    Springer
    113views Applied Computing» more  FCT 2005»
    Fully Incremental LCS Computation
    15 years 4 months ago
    Fully Incremental LCS Computation
    Download  www.shino.ecei.tohoku.ac.jp
    Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
    Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...
    claim paper
    Read More »
    BMCBI
    2007
    107views more  BMCBI 2007»
    Linking microarray reporters with protein functions
    14 years 11 months ago
    Linking microarray reporters with protein functions
    Download  www.biomedcentral.com
    Background: The analysis of microarray experiments requires accurate and up-to-date functional annotation of the microarray reporters to optimize the interpretation of the biologi...
    Stan Gaj, Arie van Erk, Rachel I. M. van Haaften, ...
    claim paper
    Read More »
    TIT
    1998
    90views more  TIT 1998»
    On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
    14 years 11 months ago
    On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
    Download  www.cst.uwaterloo.ca
    —Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
    Amir H. Banihashemi, Amir K. Khandani
    claim paper
    Read More »
    ANCS
    2005
    ACM
    137views Computer Networks» more  ANCS 2005»
    Group round robin: improving the fairness and complexity of packet scheduling
    15 years 4 months ago
    Group round robin: improving the fairness and complexity of packet scheduling
    Download  www.ncl.cs.columbia.edu
    We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
    Bogdan Caprita, Jason Nieh, Wong Chun Chan
    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.