Sciweavers

29 search results - page 6 / 6
» Optimizing exact genetic linkage computations
Sort
View
BMCBI
2006
116views more  BMCBI 2006»
13 years 4 months ago
A model-based approach to selection of tag SNPs
Background: Single Nucleotide Polymorphisms (SNPs) are the most common type of polymorphisms found in the human genome. Effective genetic association studies require the identific...
Pierre Nicolas, Fengzhu Sun, Lei M. Li
BMCBI
2006
239views more  BMCBI 2006»
13 years 4 months ago
Applying dynamic Bayesian networks to perturbed gene expression data
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek...
CEC
2007
IEEE
13 years 11 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 6 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt