Sciweavers

11231 search results - page 1770 / 2247
» Digging for Data Structures
Sort
View
142
Voted
SPAA
2009
ACM
16 years 5 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
BMCBI
2010
167views more  BMCBI 2010»
15 years 5 months ago
Creating PWMs of transcription factors using 3D structure-based computation of protein-DNA free binding energies
Background: Knowledge of transcription factor-DNA binding patterns is crucial for understanding gene transcription. Numerous DNA-binding proteins are annotated as transcription fa...
Denitsa Alamanova, Philip Stegmaier, Alexander E. ...
BMCBI
2011
15 years 1 days ago
PileLine: a toolbox to handle genome position information in next-generation sequencing studies
Background: Genomic position (GP) files currently used in next-generation sequencing (NGS) studies are always difficult to manipulate due to their huge size and the lack of approp...
Daniel Glez-Peña, Gonzalo Gómez-L&oa...
BMCBI
2007
168views more  BMCBI 2007»
15 years 5 months ago
Advancing translational research with the Semantic Web
Background: A fundamental goal of the U.S. National Institute of Health (NIH) "Roadmap" is to strengthen Translational Research, defined as the movement of discoveries i...
Alan Ruttenberg, Tim Clark, William Bug, Matthias ...
ECCV
2004
Springer
16 years 7 months ago
Dimensionality Reduction by Canonical Contextual Correlation Projections
A linear, discriminative, supervised technique for reducing feature vectors extracted from image data to a lower-dimensional representation is proposed. It is derived from classica...
Marco Loog, Bram van Ginneken, Robert P. W. Duin
« Prev « First page 1770 / 2247 Last » Next »