Sciweavers

61 search results - page 12 / 13
» Semi-algebraic Ramsey numbers
Sort
View
ICALP
2007
Springer
13 years 11 months ago
Aliased Register Allocation for Straight-Line Programs Is NP-Complete
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...
JACM
2010
116views more  JACM 2010»
13 years 3 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára
JGAA
2010
128views more  JGAA 2010»
13 years 3 months ago
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...
BMCBI
2010
116views more  BMCBI 2010»
13 years 5 months ago
SEQADAPT: an adaptable system for the tracking, storage and analysis of high throughput sequencing experiments
Background: High throughput sequencing has become an increasingly important tool for biological research. However, the existing software systems for managing and processing these ...
David B. Burdick, Christopher C. Cavnor, Jeremy Ha...
BMCBI
2007
124views more  BMCBI 2007»
13 years 5 months ago
CRISPR Recognition Tool (CRT): a tool for automatic detection of clustered regularly interspaced palindromic repeats
Background: Clustered Regularly Interspaced Palindromic Repeats (CRISPRs) are a novel type of direct repeat found in a wide range of bacteria and archaea. CRISPRs are beginning to...
Charles Bland, Teresa L. Ramsey, Fareedah Sabree, ...