Sciweavers

614 search results - page 16 / 123
» Fast Expression Templates
Sort
View
BMCBI
2005
112views more  BMCBI 2005»
13 years 7 months ago
Vector analysis as a fast and easy method to compare gene expression responses between different experimental backgrounds
Background: Gene expression studies increasingly compare expression responses between different experimental backgrounds (genetic, physiological, or phylogenetic). By focusing on ...
Rainer Breitling, Patrick Armengaud, Anna Amtmann
NIPS
2003
13 years 9 months ago
Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
Claudio Gentile
SPIRE
2010
Springer
13 years 6 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
WAE
2001
227views Algorithms» more  WAE 2001»
13 years 9 months ago
Compact DFA Representation for Fast Regular Expression Search
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speci c properties of Glushkov's nondeterministic nite automaton (NFA) construction alg...
Gonzalo Navarro, Mathieu Raffinot