Sciweavers

3652 search results - page 480 / 731
» A study of query length
Sort
View
ALGORITHMICA
2006
138views more  ALGORITHMICA 2006»
15 years 6 months ago
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
Hajo Broersma, Fedor V. Fomin, Jan Kratochví...
ANOR
2006
100views more  ANOR 2006»
15 years 6 months ago
A BMAP/G/1 Retrial Queue with a Server Subject to Breakdowns and Repairs
In this paper, we consider a BMAP/G/1 retrial queue with a server subject to breakdowns and repairs, where the life time of the server is exponential and the repair time is general...
Quan-Lin Li, Yu Ying, Yiqiang Q. Zhao
BMCBI
2006
97views more  BMCBI 2006»
15 years 6 months ago
A comparative analysis of the information content in long and short SAGE libraries
Background: Serial Analysis of Gene Expression (SAGE) is a powerful tool to determine gene expression profiles. Two types of SAGE libraries, ShortSAGE and LongSAGE, are classified...
Yi-Ju Li, Puting Xu, Xuejun Qin, Donald E. Schmech...
CORR
2006
Springer
121views Education» more  CORR 2006»
15 years 6 months ago
Number sequence representation of protein structures based on the second derivative of a folded tetrahedron sequence
A protein is a sequence of amino-acids of length typically less than 1, 000, where there are 20 kinds of amino-acids. In nature, each protein is folded into a well-defined three-d...
Naoto Morikawa
IJAC
2008
84views more  IJAC 2008»
15 years 6 months ago
Groups whose Geodesics are Locally Testable
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
Susan M. Hermiller, Derek F. Holt, Sarah Rees