Sciweavers

3864 search results - page 428 / 773
» time 2005
Sort
View
BMCBI
2005
100views more  BMCBI 2005»
15 years 6 months ago
Speeding disease gene discovery by sequence based candidate prioritization
Background: Regions of interest identified through genetic linkage studies regularly exceed 30 centimorgans in size and can contain hundreds of genes. Traditionally this number is...
Euan A. Adie, Richard R. Adams, Kathryn L. Evans, ...
BMCBI
2005
103views more  BMCBI 2005»
15 years 6 months ago
Quadratic regression analysis for gene discovery and pattern recognition for non-cyclic short time-course microarray experiments
Background: Cluster analyses are used to analyze microarray time-course data for gene discovery and pattern recognition. However, in general, these methods do not take advantage o...
Hua Liu, Sergey Tarima, Aaron S. Borders, Thomas V...
STACS
2010
Springer
16 years 1 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
16 years 11 days ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
SSS
2005
Springer
16 years 9 days ago
Synchronous vs. Asynchronous Unison
This paper considers the self-stabilizing unison problem. The contribution of this paper is threefold. First, we establish that when any self-stabilizing asynchronous unison protoc...
Christian Boulinier, Franck Petit, Vincent Villain