PubMed Health⌕ Search

PubMed · 14709180

A comparative analysis of data generated using two different target preparation methods for hybridization to high-density oligonucleotide microarrays.

Abstract

BACKGROUND: To generate specific transcript profiles, one must isolate homogenous cell populations using techniques that often yield small amounts of RNA, requiring researchers to employ RNA amplification methods. The data generated by using these methods must be extensively evaluated to determine any technique dependent distortion of the expression profiles. RESULTS: High-density oligonucleotide microarrays were used to perform experiments for comparing data generated by using two protocols, an in vitro transcription (IVT) protocol that requires 5 microg of total RNA and a double in vitro transcription (dIVT) protocol that requires 200 ng of total RNA for target preparation from RNA samples extracted from a normal and a cancer cell line. In both cell lines, about 10% more genes were detected with IVT than with dIVT. Genes were filtered to exclude those that were undetected on all arrays. Hierarchical clustering using the 9,482 genes that passed the filter showed that the variation attributable to biological differences between samples was greater than that introduced by differences in the protocols. We analyzed the behavior of these genes separately for each protocol by using a statistical model to estimate the posterior probability of various levels of fold change. At each level, more differentially expressed genes were detected with IVT than with dIVT. When we checked for genes that had a posterior probability greater than 99% of fold change greater than 2, in data generated by IVT but not dIVT, more than 60% of these genes had posterior probabilities greater than 90% in data generated by dIVT. Both protocols identified the same functional gene categories to be differentially expressed. Differential expression of selected genes was confirmed using quantitative real-time PCR. CONCLUSION: Using nanogram quantities on total RNA, the usage of dIVT protocol identified differentially expressed genes and functional categories consistent with those detected by the IVT protocol. There was a loss in sensitivity of about 10% when detecting differentially expressed genes using the dIVT protocol. However, the lower amount of RNA required for this protocol, as compared to the IVT protocol, renders this methodology a highly desirable one for biological systems where sample amounts are limiting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Gold, Kevin Coombes, Dina Medhane, Anitha Ramaswamy, Zhenlin Ju, Louise Strong, Ja Seok Koo, Mini Kapoor. 2004-01-06. A comparative analysis of data generated using two different target preparation methods for hybridization to high-density oligonucleotide microarrays.. https://doi.org/10.1186/1471-2164-5-2

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗