PubMed Health⌕ Search

PubMed · 15833835

Gene expression profiling allows distinction between primary and metastatic squamous cell carcinomas in the lung.

Abstract

Lung neoplasms commonly develop in patients previously treated for head and neck carcinomas. The derivation of these tumors, either as new primary lung cancers or as metastatic head and neck cancers, is difficult to establish based on clinical or histopathologic criteria since both are squamous cell carcinomas and have identical features under light microscopy. However, this distinction has significant treatment and prognostic implications. Gene expression profiling was performed on a panel of 52 sequentially collected patients with either primary lung (n = 21) or primary head and neck (n = 31) carcinomas using the Affymetrix HG_U95Av2 high-density oligonucleotide microarray. Unsupervised hierarchical clustering with Ward linkage and the Pearson correlation metric was performed. To assess robustness, bootstrap resampling was performed with 1,000 iterations. A t test of the normalized values for each gene was used to determine the genes responsible for segregating head and neck from lung primary carcinomas, and those with the most differential expression were used for later analyses. In the absence of a large "test" set of tumors, we used a supervised leave-one-out cross-validation to test how well we could predict the tumor origin. Once a gene expression profile was established, 12 lung lesions taken from patients with previously treated head and neck cancers were similarly analyzed by gene expression profiling to determine their sites of origin. Unsupervised clustering analysis separated the study cohort into two distinct groups which reliably remained segregated with bootstrap resampling. Group 1 consisted of 30 tongue carcinomas. Group 2 consisted of 21 lung cancers and 1 tongue carcinoma. The clustering was not changed even when normal lung or tongue profiles were subtracted from the corresponding carcinomatous lesions, and a leave-one-out cross-validation showed a 98% correct prediction (see Supplementary Data 1). A minimum set of 500 genes required to distinguish these groups was established. Given the ability to segregate these lesions using molecular profiling, we analyzed the lung tumors of undetermined origin. All cases clearly clustered with either lung or tongue tumor subsets, strongly supporting our hypothesis that this technique could elucidate the tissue of origin of metastatic lesions. Although histologically similar, squamous cell carcinomas have distinct gene expression profiles based on their anatomic sites of origin. Accordingly, the application of gene expression profiling may be useful in identifying the derivation of lung nodules and consequently enhances treatment planning.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Simon G Talbot, Cherry Estilo, Ellie Maghami, Inderpal S Sarkaria, Duy Khanh Pham, Pornchai O-charoenrat, Nicholas D Socci, Ivan Ngai, Diane Carlson, Ronald Ghossein, Agnes Viale, Bernard J Park, Valerie W Rusch, Bhuvanesh Singh. 2005-04-15. Gene expression profiling allows distinction between primary and metastatic squamous cell carcinomas in the lung.. https://doi.org/10.1158/0008-5472.can-04-1985

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↗