Sciweavers

1422 search results - page 279 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
VLDB
2004
ACM
118views Database» more  VLDB 2004»
15 years 3 months ago
On the performance of bitmap indices for high cardinality attributes
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
Kesheng Wu, Ekow J. Otoo, Arie Shoshani
SOFTVIS
2010
ACM
14 years 9 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
BMCBI
2010
104views more  BMCBI 2010»
14 years 9 months ago
Bidirectional best hit r-window gene clusters
Background: Conserved gene clusters are groups of genes that are located close to one another in the genomes of several species. They tend to code for proteins that have a functio...
Melvin Zhang, Hon Wai Leong
BMCBI
2008
128views more  BMCBI 2008»
14 years 9 months ago
Pairwise covariance adds little to secondary structure prediction but improves the prediction of non-canonical local structure
Background: Amino acid sequence probability distributions, or profiles, have been used successfully to predict secondary structure and local structure in proteins. Profile models ...
Christopher Bystroff, Bobbie-Jo M. Webb-Robertson
BMCBI
2008
166views more  BMCBI 2008»
14 years 9 months ago
Learning transcriptional regulatory networks from high throughput gene expression data using continuous three-way mutual informa
Background: Probability based statistical learning methods such as mutual information and Bayesian networks have emerged as a major category of tools for reverse engineering mecha...
Weijun Luo, Kurt D. Hankenson, Peter J. Woolf