Sciweavers

28 search results - page 5 / 6
» Intervals and Orders: What Comes After Interval Orders
Sort
View
BMCBI
2007
154views more  BMCBI 2007»
13 years 6 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
RTSS
2006
IEEE
14 years 9 days ago
Tightening the Bounds on Feasible Preemption Points
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
Harini Ramaprasad, Frank Mueller
ICCCN
1998
IEEE
13 years 10 months ago
Fast Recovery Protocol for Database and Link Failures in Mobile Networks
An important issue in the design of future Personal Communication Services (PCS) networks is the efficient management of location information. The current IS-41 standard P C S arc...
Govind Krishnamurthi, Stefano Chessa, Arun K. Soma...
BMCBI
2010
151views more  BMCBI 2010»
13 years 6 months ago
Misty Mountain clustering: application to fast unsupervised flow cytometry gating
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
István P. Sugár, Stuart C. Sealfon
BMCBI
2006
118views more  BMCBI 2006»
13 years 6 months ago
Identification of gene expression patterns using planned linear contrasts
Background: In gene networks, the timing of significant changes in the expression level of each gene may be the most critical information in time course expression profiles. With ...
Hao Li, Constance L. Wood, Yushu Liu, Thomas V. Ge...