Wen‐Yu Chung

ORCID: 0000-0003-3746-7301
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Epigenetics and DNA Methylation
  • Quantum Computing Algorithms and Architecture
  • Advanced biosensing and bioanalysis techniques
  • Air Quality and Health Impacts
  • Asthma and respiratory diseases
  • Bladder and Urothelial Cancer Treatments
  • Cancer Genomics and Diagnostics
  • Genetic Syndromes and Imprinting
  • Quantum-Dot Cellular Automata
  • Toxic Organic Pollutants Impact
  • RNA modifications and cancer
  • DNA and Biological Computing
  • Renal cell carcinoma treatment
  • Vehicle emissions and performance
  • Air Quality Monitoring and Forecasting
  • Climate Change and Health Impacts
  • Head and Neck Cancer Studies
  • Renal and related cancers
  • Cancer Cells and Metastasis
  • Quantum Information and Cryptography
  • Inhalation and Respiratory Drug Delivery
  • Bipolar Disorder and Treatment
  • Gene expression and cancer classification
  • Zebrafish Biomedical Research Applications
  • Pulmonary Hypertension Research and Treatments

National Kaohsiung University of Science and Technology
2021-2024

University of Science and Technology
2021-2024

National Center for Theoretical Sciences
2023

National Taiwan University
2023

University of Agder
2023

Chang Gung University
2023

Kaohsiung Medical University Chung-Ho Memorial Hospital
2022

Kaohsiung Municipal Ta-Tung Hospital
2022

Weatherford College
2022

United Hospital
2022

Abstract Summary: We report on a major new version of the RMAP software for mapping reads from short-read sequencing technology. General improvements to accuracy and space requirements are included, along with novel functionality. Included in package tools paired-end reads, using more sophisticated use quality scores, collecting ambiguous locations bisulfite-treated reads. Availability: The applications described this note available download at http://www.cmb.usc.edu/people/andrewds/rmap...

10.1093/bioinformatics/btp533 article EN cc-by-nc Bioinformatics 2009-09-07

Coding of multiple proteins by overlapping reading frames is not a feature one would associate with eukaryotic genes. Indeed, codependency between codons protein-coding regions imposes unique set evolutionary constraints, making it costly arrangement. Yet in cases tightly coexpressed interacting proteins, dual coding may be advantageous. Here we show that although nearly impossible chance, number human transcripts contain regions. Using newly developed statistical techniques, identified 40...

10.1371/journal.pcbi.0030091 article EN cc-by PLoS Computational Biology 2007-05-15

In this paper, we propose a bio-molecular algorithm with O( n2 + m ) biological operations, 2n DNA strands, n tubes and the longest strand, ), for solving independent-set problem any graph G edges vertices. Next, show that new kind of straightforward Boolean circuit yielded from solutions NAND gates, ( +n × 1 )) AND gates (( ))/2) NOT can find maximal independent-set(s) to We proposed quantum-molecular independent set(s) lower bound Ω 2n/2 queries upper queries. This work offers an obvious...

10.1109/tnb.2021.3075733 article EN IEEE Transactions on NanoBioscience 2021-04-26

Abstract A dominating set of a graph $$G = (V, E)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>G</mml:mi> <mml:mo>=</mml:mo> <mml:mo>(</mml:mo> <mml:mi>V</mml:mi> <mml:mo>,</mml:mo> <mml:mi>E</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> is subset U its vertices V , such that any vertex G either in or has neighbor . The dominating-set problem to find minimum Dominating sets are critical importance for various types networks/graphs, and therefore...

10.1038/s41598-023-30600-4 article EN cc-by Scientific Reports 2023-03-14

Background Adult asthma is phenotypically heterogeneous with unclear aetiology. We aimed to evaluate the potential contribution of environmental exposure and its ensuing response heterogeneity. Methods Environmental risk was evaluated by assessing records National Health Insurance Research Database (NHIRD) residence-based air pollution (particulate matter diameter less than 2.5 micrometers (PM ) PM -bound polycyclic aromatic hydrocarbons (PAHs)), integrating biomonitoring analysis...

10.1136/thoraxjnl-2021-218396 article EN Thorax 2022-06-16

In this paper, we propose a bio-molecular algorithm with O( n 2) biological operations, 2n-1 ) DNA strands, tubes and the longest strand, ), for inferring value of bit from only output satisfying any given condition in an unsorted database 2n items bits. We show that each outcome is determined by executing our times. Then, how to view solution space strands as eigenvector find corresponding unitary operator eigenvalues output. also using extension quantum phase estimation counting algorithms...

10.1109/tnb.2021.3130811 article EN IEEE Transactions on NanoBioscience 2021-11-25

Abstract Neurotrophic receptor tyrosine kinase 3 (NTRK3) has pleiotropic functions: it acts not only as an oncogene in breast and gastric cancers but also a dependence tumor suppressor genes colon cancer neuroblastomas. However, the role of NTRK3 upper tract urothelial carcinoma (UTUC) is well documented. This study investigated association between expression outcomes UTUC patients validated results tests on cell lines. A total 118 tissue samples were examined to evaluate NTRK3. Survival...

10.1002/kjm2.12824 article EN cc-by The Kaohsiung Journal of Medical Sciences 2024-04-09

Given an undirected, unweighted graph with $n$ vertices and $m$ edges, the maximum cut problem is to find a partition of into disjoint subsets $V_1$ $V_2$ such that number edges between them as large possible. Classically, it NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning network science clustering. In this paper, we propose quantum algorithm solve for any $G$ quadratic speedup over its...

10.48550/arxiv.2305.16644 preprint EN cc-by-nc-sa arXiv (Cornell University) 2023-01-01

In recent years, knowledge discovery in databases provides a powerful capability to discover meaningful and useful information. For numerous real-life applications, frequent pattern mining association rule have been extensively studied. traditional algorithms, data are centralized memory-resident. As result of the large amount data, bandwidth limitation, energy limitations when applying these methods distributed databases, especially this era big performance is not effective enough. Hence,...

10.1109/access.2021.3115514 article EN cc-by IEEE Access 2021-01-01

Abstract Kidney transplantation is a lifesaving option for patients with end-stage kidney disease. In Taiwan, urothelial carcinoma (UC) the most common de novo cancer after (KT). UC has greater degree of molecular heterogeneity than do other solid tumors. Few studies have explored genomic alterations in KT. We performed whole-exome sequencing to compare genetic developed (UCKT) and on hemodialysis (UCHD). After mapping variant calling, 18,733 11,093 variants were identified UCKT UCHD,...

10.1186/s12967-022-03522-4 article EN cc-by Journal of Translational Medicine 2022-07-21

Exposure to polycyclic aromatic hydrocarbons (PAHs) associated with ambient air particulate matter (PM) poses significant health concerns. Increased acute exacerbation (AE) frequency in asthmatic patients has been PAHs, but which subgroup of are particularly susceptible PAHs is uncertain. We developed a new model simulate grid-scale PM2.5-PAH levels order evaluate whether the severity asthma as measured by Global Initiative Asthma (GINA) treatment related cumulative exposure PAHs.Patients...

10.2147/jaa.s288052 article EN Journal of Asthma and Allergy 2021-01-01

Megacity residents may suffer adverse health effects, because polycyclic aromatic hydrocarbons associated with particulate matter (PM2.5-PAHs) are carcinogenic and the abundance of emission sources. In this study, we investigated spatiotemporal distribution PM2.5-PAHs in Taipei areas estimated potential sources using Principal Component Analysis-Absolute Score (PCA-APCS) to evaluate lifetime excess cancer risk (ECR). The mean concentration was 1.11 ± 0.79 ng m-3, corresponding benzo[a]pyrene...

10.2139/ssrn.4704498 preprint EN 2024-01-01

Given an undirected, unweighted graph with n vertices and m edges, the maximum cut problem is to find a partition of into disjoint subsets V <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> such that number edges between them as large possible. Classically, it NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision,...

10.1109/tnb.2024.3395420 article EN IEEE Transactions on NanoBioscience 2024-04-30

Given an undirected, unweighted graph with n vertices and m edges, the maximum cut problem is to find a partition of into disjoint subsets V1 V2 such that number edges between them as large possible. Classically, it NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning network science clustering. In this paper, we propose biomolecular quantum algorithm solve for any G. The inspired by quadratic speedup...

10.36227/techrxiv.24736389.v2 preprint EN 2024-05-09

Whole-genome DNA methylation sequencing provides both patterns and genetic information. We utilized base resolution methylomes to directly identify allelic linkage of genomic variants. The paired association was further extended construct hepitypes by the simultaneous phasing genotype methylation. Using such approach, reads provide direct statistics interdependence between methylcytosines nucleotide variations; consequently, detailed epigenetic variations can be readily inferred data....

10.1166/jnsne.2013.1067 article EN Journal of Neuroscience and Neuroengineering 2013-08-01

Given an undirected, unweighted graph with n vertices and m edges, the maximum cut problem is to find a partition of into disjoint subsets V1 V2 such that number edges between them as large possible. Classically, it NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning network science clustering. In this paper, we propose biomolecular quantum algorithm solve for any G. The inspired by quadratic speedup...

10.36227/techrxiv.24736389.v1 preprint EN cc-by 2023-12-07

&lt;div&gt;Given an undirected, unweighted graph with n vertices and m edges, the maximum cut problem is to find a partition of into disjoint subsets V&lt;sub&gt;1 &lt;/sub&gt;and V&lt;sub&gt;2&lt;/sub&gt; such that number edges between them as large possible. Classically, it NP-complete problem, which has potential applications ranging from circuit layout design, statistical physics, computer vision, machine learning network science clustering. In this paper, we propose biomolecular quantum...

10.36227/techrxiv.24736389 preprint EN cc-by 2023-12-07

Imprinting, characterized by unequal expression of the offspring's genes in a parent-of-origin dependent manner, has been functionally implicated brain development and psychiatric disorders. In this study, unambiguous distortion paternal but not maternal transmission disease-associated single-nucleotide polymorphism (SNP) rs6556547 (T/G) clearly indicated presence effect (POE) GABA A receptor β 2 subunit gene (GABRB2). ‘Flipping’ allelic mRNA heterozygotes SNP rs2229944 (C/T) observed...

10.1016/s0924-9338(11)72528-7 article EN European Psychiatry 2011-03-01
Coming Soon ...