4908 search results - page 872 / 982 » On the Complexity of Optimal K-Anonymity |
213
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Computational comparison of two protein structures is the starting point of many methods that build on existing knowledge, such as structure modeling (including modeli...
174
click to vote
BMCBI
2010
2010
The IronChip evaluation package: a package of perl modules for robust analysis of custom microarrays
15 years 6 months ago
Background: Gene expression studies greatly contribute to our understanding of complex relationships in gene regulatory networks. However, the complexity of array design, producti...
178
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
194
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Integration of multiple results from Quantitative Trait Loci (QTL) studies is a key point to understand the genetic determinism of complex traits. Up to now many effor...
174
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...