Sciweavers

    10988 search results - page 8 / 2198
    » Algorithmic Folding Complexity
    Sort
    View
    NIPS
    2008
    149views Information Technology» more  NIPS 2008»
    Scalable Algorithms for String Kernels with Inexact Matching
    13 years 9 months ago
    Scalable Algorithms for String Kernels with Inexact Matching
    Download  www.cs.rutgers.edu
    We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
    Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
    claim paper
    Read More »
    AI
    2003
    Springer
    139views Artificial Intelligence» more  AI 2003»
    An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
    14 years 28 days ago
    An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
    Download  csb.stanford.edu
    The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current focus on a widely studied abst...
    Alena Shmygelska, Holger H. Hoos
    claim paper
    Read More »
    BMCBI
    2005
    152views more  BMCBI 2005»
    An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem
    13 years 7 months ago
    An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem
    Download  www.biomedcentral.com
    Background: The protein folding problem is a fundamental problems in computational molecular biology and biochemical physics. Various optimisation methods have been applied to for...
    Alena Shmygelska, Holger H. Hoos
    claim paper
    Read More »
    ISMB
    1996
    120views Computational Biology» more  ISMB 1996»
    A Grammar-Based Unification of Several Alignment and Folding Algorithms
    13 years 9 months ago
    A Grammar-Based Unification of Several Alignment and Folding Algorithms
    Download  www.aaai.org
    Weshowin this paper that manypopular models of folding and/or alignment maybe described by a new formalism: multi-tape S-attribute grammars(MTSAG's).This formalism relieves t...
    Fabrice Lefebvre
    claim paper
    Read More »
    BMCBI
    2007
    233views more  BMCBI 2007»
    160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
    13 years 7 months ago
    160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
    Download  www.biomedcentral.com
    Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
    Isaac T. S. Li, Warren Shum, Kevin Truong
    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-2024, USA.