Sciweavers

BMCBI
2004
97views more  BMCBI 2004»
13 years 9 months ago
Performance of a genetic algorithm for mass spectrometry proteomics
Background: Recently, mass spectrometry data have been mined using a genetic algorithm to produce discriminatory models that distinguish healthy individuals from those with cancer...
Neal O. Jeffries
BMCBI
2004
125views more  BMCBI 2004»
13 years 9 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner
BMCBI
2004
158views more  BMCBI 2004»
13 years 9 months ago
Improvement of alignment accuracy utilizing sequentially conserved motifs
Background: Multiple sequence alignment algorithms are very important tools in molecular biology today. Accurate alignment of proteins is central to several areas such as homology...
Saikat Chakrabarti, Nitin Bhardwaj, Prem A. Anand,...
AUTOMATICA
2004
92views more  AUTOMATICA 2004»
13 years 9 months ago
Randomized algorithms for quadratic stability of quantized sampled-data systems,
In this paper, we present a novel development of randomized algorithms for quadratic stability analysis of sampled-data systems with memoryless quantizers. The speci
Hideaki Ishii, Tamer Basar, Roberto Tempo
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 9 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
13 years 9 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...
AI
2002
Springer
13 years 9 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo
AI
2002
Springer
13 years 9 months ago
Algorithm for optimal winner determination in combinatorial auctions
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
Tuomas Sandholm
KES
2007
Springer
13 years 9 months ago
Experimental Analysis of the Aging Operator for Static and Dynamic Optimisation Problems
Abstract. This work presents an analysis of the static Aging operator for different evolutionary algorithms: two immunological algorithms (OptIA and Clonalg), a standard genetic a...
Mario Castrogiovanni, Giuseppe Nicosia, Rosario Ra...
ACTAC
2002
102views more  ACTAC 2002»
13 years 9 months ago
Handling Pointers and Unstructured Statements in the Forward Computed Dynamic Slice Algorithm
Different program slicing methods are used for debugging, testing, reverse engineering and maintenance. Slicing algorithms can be classified as a static slicing or dynamic slicing...
Csaba Faragó, Tamás Gergely