Search PubMed⌕ Search

Biomedical subjects

Andrew Wan

Publications and source records attributed to Andrew Wan.

3 recordsLinked to original sources

ASXL1 truncating variants in BOS and myeloid leukemia drive shared disruption of Wnt-signaling pathways but have differential isoform usage of RUNX3.

BACKGROUND: Rare variants in epigenes (a.k.a. chromatin modifiers), a class of genes that control epigenetic regulation, are commonly identified in both pediatric neurodevelopmental syndromes and as somatic variants in cancer. However, little is known about the extent of the shared disruption of signaling pathways by the same epigene across different diseases. To address this, we study an epigene, Additional Sex Combs-like 1 (ASXL1), where truncating heterozygous variants cause Bohring-Opitz syndrome (BOS, OMIM #605039), a germline neurodevelopmental disorder, while somatic variants are driver events in acute myeloid leukemia (AML). No BOS patients have been reported to have AML. METHODS: This study explores common pathways dysregulated by ASXL1 variants in patients with BOS and AML. We analyzed whole blood transcriptomic and DNA methylation data from patients with BOS and AML with ASXL1-variant (AML-ASXL1) and examined differential exon usage and cell proportions. RESULTS: Our analyses identified common molecular signatures between BOS and AML-ASXL1 and highlighted key biomarkers, including VANGL2, GRIK5 and GREM2, that are dysregulated across samples with ASXL1 variants, regardless of disease type. Notably, our data revealed significant de-repression of posterior homeobox A (HOXA) genes and upregulation of Wnt-signaling and hematopoietic regulator HOXB4. While we discovered many shared epigenetic and transcriptomic features, we also identified differential splice isoforms in RUNX3 where the long isoform, p46, is preferentially expressed in BOS, while the shorter p44 isoform is expressed in AML-ASXL1. CONCLUSION: Our findings highlight the strong effects of ASXL1 variants that supersede cell-type and even disease states. This is the first direct comparison of transcriptomic and methylation profiles driven by pathogenic variants in a chromatin modifier gene in distinct diseases. Similar to RASopathies, in which pathogenic variants in many genes lead to overlapping phenotypes that can be treated by inhibiting a common pathway, our data identifies common pathways for ASXL1 variants that can be targeted for both disease states. Comparative approaches of high-penetrance genetic variants across cell types and disease states can identify targetable pathways to treat multiple diseases. Finally, our work highlights the connections of epigenes, such as ASXL1, to an underlying stem-cell state in both early development and in malignancy.

Humans↗

A fast parallel algorithm for finding the longest common sequence of multiple biosequences.

BACKGROUND: Searching for the longest common sequence (LCS) of multiple biosequences is one of the most fundamental tasks in bioinformatics. In this paper, we present a parallel algorithm named FAST_LCS to speedup the computation for finding LCS. RESULTS: A fast parallel algorithm for LCS is presented. The algorithm first constructs a novel successor table to obtain all the identical pairs and their levels. It then obtains the LCS by tracing back from the identical character pairs at the last level. Effective pruning techniques are developed to significantly reduce the computational complexity. Experimental results on gene sequences in the tigr database show that our algorithm is optimal and much more efficient than other leading LCS algorithms. CONCLUSION: We have developed one of the fastest parallel LCS algorithms on an MPP parallel computing model. For two sequences X and Y with lengths n and m, respectively, the memory required is max{4*(n+1)+4*(m+1), L}, where L is the number of identical character pairs. The time complexity is O(L) for sequential execution, and O(|LCS(X, Y)|) for parallel execution, where |LCS(X, Y)| is the length of the LCS of X and Y. For n sequences X1, X2, ..., Xn, the time complexity is O(L) for sequential execution, and O(|LCS(X1, X2, ..., Xn)|) for parallel execution. Experimental results support our analysis by showing significant improvement of the proposed method over other leading LCS algorithms.

Algorithms↗

Inflammatory myofibroblastic tumour of the gallbladder.

BACKGROUND: Inflammatory myofibroblastic tumour (IMT) is a benign, nonmetastasizing proliferation of myofibroblasts with a potential for local infiltration, recurrence and persistent local growth. CASE REPORT: We report a case of a 51 year-old female, who had excision of a gallbladder tumour. Histopathology showed it to be IMT of the gallbladder. CONCLUSION: The approach to these tumours should be primarily surgical resection to obtain a definitive diagnosis and relieve symptoms. IMT has a potential for local infiltration, recurrence and persistent local growth.

Journal Article↗