6,564 research outputs found
A simplified search strategy for identifying randomised controlled trials for systematic reviews of health care interventions : a comparison with more exhaustive strategies
Background
It is generally believed that exhaustive searches of bibliographic databases are needed for systematic reviews of health care interventions. The CENTRAL database of controlled trials (RCTs) has been built up by exhaustive searching. The CONSORT statement aims to encourage better reporting, and hence indexing, of RCTs. Our aim was to assess whether developments in the CENTRAL database, and the CONSORT statement, mean that a simplified RCT search strategy for identifying RCTs now suffices for systematic reviews of health care interventions.
Methods
RCTs used in the Cochrane reviews were identified. A brief RCT search strategy (BRSS), consisting of a search of CENTRAL, and then for variants of the word random across all fields (random.af." was compared to the highly sensitive search strategy (HSSS).
Results
The BRSS had a sensitivity of 94%. It found all journal RCTs in 47 of the 57 reviews. The missing RCTs made some significant differences to a small proportion of the total outcomes in only five reviews, but no important differences in conclusions resulted. In the post-CONSORT years, 1997β2003, the percentage of RCTs with random in the title or abstract was 85%, a mean increase of 17% compared to the seven years pre-CONSORT (95% CI, 8.3% to 25.9%). The search using random$.af. reduced the MEDLINE retrieval by 84%, compared to the HSSS, thereby reducing the workload of checking retrievals.
Conclusion
A brief RCT search strategy is now sufficient to locate RCTs for systematic reviews in most cases. Exhaustive searching is no longer cost-effective, because in effect it has already been done for CENTRAL
The Brown-Colbourn conjecture on zeros of reliability polynomials is false
We give counterexamples to the Brown-Colbourn conjecture on reliability
polynomials, in both its univariate and multivariate forms. The multivariate
Brown-Colbourn conjecture is false already for the complete graph K_4. The
univariate Brown-Colbourn conjecture is false for certain simple planar graphs
obtained from K_4 by parallel and series expansion of edges. We show, in fact,
that a graph has the multivariate Brown-Colbourn property if and only if it is
series-parallel.Comment: LaTeX2e, 17 pages. Version 2 makes a few small improvements in the
exposition. To appear in Journal of Combinatorial Theory
- β¦