Sciweavers

600 search results - page 20 / 120
» Problems and results in extremal combinatorics - II
Sort
View
COCOON
2008
Springer
13 years 9 months ago
Quasi-bicliques: Complexity and Binding Pairs
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
Xiaowen Liu, Jinyan Li, Lusheng Wang
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
14 years 2 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
SETN
2010
Springer
13 years 12 months ago
Genetic Algorithm Solution to Optimal Sizing Problem of Small Autonomous Hybrid Power Systems
The optimal sizing of a small autonomous hybrid power system can be a very challenging task, due to the large number of design settings and the uncertainty in key parameters. This ...
Yiannis A. Katsigiannis, Pavlos S. Georgilakis, Em...
EUROGP
1998
Springer
14 years 5 days ago
Immediate Transfer of Global Improvements to All Individuals in a Population Compared to Automatically Defined Functions for the
Koza has shown how automatically defined functions (ADFs) can reduce computational effort in the GP paradigm. In Koza's ADF, as well as in standard GP, an improvement in a par...
Ricardo Aler
COCOON
2011
Springer
12 years 7 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...