Sciweavers

2474 search results - page 276 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
15 years 12 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
GECCO
2008
Springer
133views Optimization» more  GECCO 2008»
15 years 7 months ago
Automatic generation of XSLT stylesheets using evolutionary algorithms
This paper introduces a procedure based on genetic programming to evolve XSLT programs (usually called stylesheets or logicsheets). XSLT is a general purpose, document-oriented fu...
Pablo García-Sánchez, Juan Juli&aacu...
BMCBI
2006
127views more  BMCBI 2006»
15 years 6 months ago
Automatic discovery of cross-family sequence features associated with protein function
Background: Methods for predicting protein function directly from amino acid sequences are useful tools in the study of uncharacterised protein families and in comparative genomic...
Markus Brameier, Josien Haan, Andrea Krings, Rober...
GRID
2004
Springer
15 years 11 months ago
An Early Evaluation of WSRF and WS-Notification via WSRF.NET
The Web Services Resource Framework (WSRF) and its companion WS-Notification were introduced in January 2004 as a new model on which to build Grids. This paper contains early obse...
Marty A. Humphrey, Glenn S. Wasson, Mark M. Morgan...
TCS
2008
15 years 6 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi