Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Mao, Chao"'
Publikováno v:
Computational Materials Science. 111:47-53
Adsorption energies, structural properties and electronic structures of atomic bromine adsorbed in on-surface sites on Mg(0 0 0 1) surface were investigated by using the density functional theory. Bromine coverages varying from 0.25 to 1.00 monolayer
Publikováno v:
International Journal of Computational Geometry & Applications. 21:283-311
For the \textsc{Minkowski Sum Selection} problem with linear objective functions, we obtain the following results: (1) optimal $O(n\log n)$ time algorithms for $\lambda=1$; (2) $O(n\log^2 n)$ time deterministic algorithms and expected $O(n\log n)$ ti
Autor:
Chia Ying Yang, Ya Ling Yu, Tzu Ling Tseng, Yi Ren Hong, Chi Ying F. Huang, Tsu Chun Emma Lin, Jinn-Moon Yang, Chao Hui Chang, Sheng-An Lee, Chueh Chuan Yen, Kun-Mao Chao, Jin Mei Lai
Publikováno v:
ECCB
Motivation: To fully understand how a protein kinase regulates biological processes, it is imperative to first identify its substrate(s) and interacting protein(s). However, of the 518 known human serine/threonine/tyrosine kinases, 35% of these have
Publikováno v:
Bioinformatics. 22:685-691
Motivation: Recent studies have shown that a small subset of Single Nucleotide Polymorphisms (SNPs) (called tag SNPs) is sufficient to capture the haplotype patterns in a high linkage disequilibrium region. To find the minimum set of tag SNPs, exact
Publikováno v:
Journal of Algorithms. 36:182-204
Given an undirected graph with nonnegative edge lengths and nonnegative vertex weights, the routing requirement of a pair of vertices is assumed to be the product of their weights. The routing cost for a pair of vertices on a given spanning tree is d
Publikováno v:
Bioinformatics. 24:2773-2775
Summary: CNVDetector is a program for locating copy number variations (CNVs) in a single genome. CNVDetector has several merits: (i) it can deal with the array comparative genomic hybridization data even if the noise is not normally distributed; (ii)
Publikováno v:
International Journal of Computational Geometry & Applications. 23:425-426
Publikováno v:
SAC
This paper studies haplotype inference by maximum parsimony using population data. We define the optimal haplotype inference (OHI) problem as given a set of genotypes and a set of related haplotypes, find a minimum subset of haplotypes that can resol
Autor:
Kun-Mao Chao, Xiaoqiu Huang
Publikováno v:
Bioinformatics (Oxford, England). 19(2)
Motivation: Homologous sequences are sometimes similar over some regions but different over other regions. Homologous sequences have a much lower global similarity if the different regions are much longer than the similar regions. Results: We present
Autor:
Kun-Mao Chao
Publikováno v:
Bioinformatics (Oxford, England). 15(4)
MOTIVATION: Given a genomic DNA sequence, it is still an open problem to determine its coding regions, i.e. the region consisting of exons and introns. The comparison of cDNA and genomic DNA helps the understanding of coding regions. For such an appl