Sciweavers

7758 search results - page 1292 / 1552
» On the Number of Distributive Lattices
Sort
View
AI
2010
Springer
15 years 6 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
166
Voted
BMCBI
2010
124views more  BMCBI 2010»
15 years 6 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
BMCBI
2010
111views more  BMCBI 2010»
15 years 6 months ago
Dynamic probe selection for studying microbial transcriptome with high-density genomic tiling microarrays
Background: Current commercial high-density oligonucleotide microarrays can hold millions of probe spots on a single microscopic glass slide and are ideal for studying the transcr...
Hedda Høvik, Tsute Chen
BMCBI
2008
153views more  BMCBI 2008»
15 years 6 months ago
AWclust: point-and-click software for non-parametric population structure analysis
Background: Population structure analysis is important to genetic association studies and evolutionary investigations. Parametric approaches, e.g. STRUCTURE and L-POP, usually ass...
Xiaoyi Gao, Joshua D. Starmer
BMCBI
2007
107views more  BMCBI 2007»
15 years 6 months ago
Reuse of structural domain-domain interactions in protein networks
Background: Protein interactions are thought to be largely mediated by interactions between structural domains. Databases such as iPfam relate interactions in protein structures t...
Benjamin Schuster-Böckler, Alex Bateman
« Prev « First page 1292 / 1552 Last » Next »