| 1. |
- Kemmer, D., et al.
(författare)
-
Exploring the foundation of genomics : a Northern blot reference set for the comparative analysis of transcript profiling technologies
- 2004
-
Ingår i: Comparative and functional genomics. - : Hindawi Limited. - 1531-6912 .- 1532-6268. ; 5:8, s. 584-595
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper we aim to create a reference data collection of Northern blot results and demonstrate how such a collection can enable a quantitative comparison of modern expression profiling techniques, a central component of functional genomics studies. Historic ally, Northern blots were the de facto standard for determining RNA transcript levels. However, driven by the demand for analysis of large sets of genes in parallel, high-throughput methods, such as microarrays, dominate modern profiling efforts. To facilitate assessment of these methods, in comparison to Northern blots, we created a database of published Northern results obtained with a standardized commercial multiple tissue blot (dbMTN). In order to demonstrate the utility of the dbMTN collection for technology comparison, we also generated expression profiles for genes across a set of human tissues, using multiple profiling techniques. No method produced profiles that were strongly correlated with the Northern blot data. The highest correlations to the Northern blot data were determined with microarrays for the subset of genes observed to be specifically expressed in a single tissue in the Northern analyses. The database and expression profiling data are available via the project website (http://www.cisreg.ca). We believe that emphasis on multitechnique validation of expression profiles is justified, as the correlation results between platforms are not encouraging on the whole. Supplementary material for this article can be found at: http://www.interscience.wiley.com/jpages/1531-6912/suppmat
|
|
| 3. |
- Agarwal, PK, et al.
(författare)
-
Box-trees and R-trees with near-optimal query time
- 2002
-
Ingår i: Discrete & Computational Geometry. - : Springer Science and Business Media LLC. - 0179-5376 .- 1432-0444. ; 28:3, s. 291-312
-
Tidskriftsartikel (refereegranskat)abstract
- A box-tree is a bounding-volume hierarchy that uses axis-aligned boxes as bounding volumes. The query complexity of a box-tree with respect to a given type of query is the maximum number of nodes visited when answering such a query. We describe several new algorithms for constructing box-trees with small worst-case query complexity with respect to queries with axis-parallel boxes and with points. We also prove lower bounds on the Worst-case query complexity for box-trees, which show that our results are optimal or close to optimal. Finally, we present algorithms to convert box-trees to R-trees, resulting in R-trees with (almost) optimal query complexity.
|
|
