Sciweavers

444 search results - page 17 / 89
» Selectional Restrictions in HPS
Sort
View
RECOMB
2009
Springer
14 years 4 months ago
Protein Fragment Swapping: A Method for Asymmetric, Selective Site-Directed Recombination
This paper presents a new approach to site-directed recombination, swapping combinations of selected discontiguous fragments from a source protein in place of corresponding fragmen...
Wei Zheng, Karl E. Griswold, Chris Bailey-Kellogg
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...
IPSN
2005
Springer
14 years 3 months ago
The sensor selection problem for bounded uncertainty sensing models
We address the problem of selecting sensors so as to minimize the error in estimating the position of a target. We consider a generic sensor model where the measurements can be in...
Volkan Isler, Ruzena Bajcsy
BMCBI
2007
124views more  BMCBI 2007»
13 years 9 months ago
BranchClust: a phylogenetic algorithm for selecting gene families
Background: Automated methods for assembling families of orthologous genes include those based on sequence similarity scores and those based on phylogenetic approaches. The first ...
Maria S. Poptsova, J. Peter Gogarten
ACG
2009
Springer
14 years 4 months ago
Plans, Patterns, and Move Categories Guiding a Highly Selective Search
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
Gerhard Trippen