Sciweavers

102291 search results - page 20218 / 20459
» Computability in Computational Geometry
Sort
View
TIT
2008
116views more  TIT 2008»
15 years 4 months ago
On the Complexity of Hardness Amplification
We study the task of transforming a hard function f, with which any small circuit disagrees on (1 - )/2 fraction of the input, into a harder function f , with which any small circ...
Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu
BMCBI
2005
115views more  BMCBI 2005»
15 years 4 months ago
SUPERFICIAL - Surface mapping of proteins via structure-based peptide library design
Background: The determination of protein surfaces and the detection of binding sites are essential to our understanding of protein-protein interactions. Such binding sites can be ...
Andrean Goede, Ines S. Jaeger, Robert Preissner
BMCBI
2005
103views more  BMCBI 2005»
15 years 4 months ago
Many accurate small-discriminatory feature subsets exist in microarray transcript data: biomarker discovery
Background: Molecular profiling generates abundance measurements for thousands of gene transcripts in biological samples such as normal and tumor tissues (data points). Given such...
Leslie Grate
BMCBI
2005
113views more  BMCBI 2005»
15 years 4 months ago
PentaPlot: A software tool for the illustration of genome mosaicism
Background: Dekapentagonal maps depict the phylogenetic relationships of five genomes in a visually appealing diagram and can be viewed as an alternative to a single evolutionary ...
Lutz Hamel, Olga Zhaxybayeva, J. Peter Gogarten
BMCBI
2005
109views more  BMCBI 2005»
15 years 4 months ago
Genome comparison without alignment using shortest unique substrings
Background: Sequence comparison by alignment is a fundamental tool of molecular biology. In this paper we show how a number of sequence comparison tasks, including the detection o...
Bernhard Haubold, Nora Pierstorff, Friedrich M&oum...
« Prev « First page 20218 / 20459 Last » Next »