Sciweavers

1887 search results - page 4 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
FOCS
2006
IEEE
13 years 12 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
BMCBI
2007
166views more  BMCBI 2007»
13 years 5 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
CONCUR
2008
Springer
13 years 7 months ago
Dynamic Partial Order Reduction Using Probe Sets
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
Harmen Kastenberg, Arend Rensink
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 6 months ago
Clustering pair-wise dissimilarity data into partially ordered sets
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...
TCBB
2011
13 years 22 days ago
A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data
—Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ eithe...
Zengyou He, Can Yang, Weichuan Yu