Results 1  10
of
131
Review Article Pharmacogenomics and HerbDrug Interactions: Merge of Future and Tradition MouZe Liu,1,2 YueLi Zhang,1,2 MeiZi Zeng,1,2 FaZhong He,1,2 ZhiYing Luo,1,2
"... Copyright © 2015 MouZe Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Theworldwide using of herb products and the increa ..."
Abstract
 Add to MetaCart
Copyright © 2015 MouZe Liu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Theworldwide using of herb products and the increasing potential herbdrug interaction issue has raised enthusiasmondiscovering the underlying mechanisms. Previous review indicated that the interactions may be mediated by metabolism enzymes and transporters in pharmacokinetic pathways.On the other hand, an increasing number of studies found that genetic variations showed some influence on herbdrug interaction effects whereas these genetic factors did not drawmuch attention in history. We highlight that pharmacogenomics may involve the pharmacokinetic or pharmacodynamic pathways to affect herbdrug interaction. We are here to make an updated review focused on some common herbdrug interactions in association with genetic variations, with the aim to help safe use of herbal medicines in different individuals in the clinic. 1.
Keywords: Offpump Occlusion, Minimal invasive surgery, Congenital Heart Disease, Transesophageal
"... Offpump occlusion of transthoracic minimal invasive surgery (OPOTTMIS) on simple congenital heart diseases (ASD, VSD and PDA) attached consecutive 210 cases report: A single institute experience Qingkui Guo, Zhiqian Lu * , Shaofei Cheng, Yong Cao, Yonghong Zhao, Cheng Zhang and Yueli Zhang Ob ..."
Abstract
 Add to MetaCart
Offpump occlusion of transthoracic minimal invasive surgery (OPOTTMIS) on simple congenital heart diseases (ASD, VSD and PDA) attached consecutive 210 cases report: A single institute experience Qingkui Guo, Zhiqian Lu * , Shaofei Cheng, Yong Cao, Yonghong Zhao, Cheng Zhang and Yueli Zhang
ZHANG Hongqin1,ZHANG Yujun1,ZHANG Aihua2,LI Changzhu2,
"... on the preparation of rich hydrocarbon biodiesel from Cornus ..."
Optimal Independent Spanning Trees on Hypercubes
, 2004
"... Two spanning trees rooted at some vertex r in a graph G are said to be independent if for each vertex v of G, v ≠ r, the paths from r to v in two trees are vertexdisjoint. A set of spanning trees of G is said to be independent if they are pairwise independent. A set of independent spanning trees is ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Two spanning trees rooted at some vertex r in a graph G are said to be independent if for each vertex v of G, v ≠ r, the paths from r to v in two trees are vertexdisjoint. A set of spanning trees of G is said to be independent if they are pairwise independent. A set of independent spanning trees is optimal if the average path length of the trees is the minimum. Any kdimensional hypercube has k independent spanning trees rooted at an arbitrary vertex. In this paper, an O(kn) time algorithm is proposed to construct k optimal independent spanning trees on a kdimensional hypercube, where n = 2 k is the number of vertices in a hypercube.
c○2007 The Korean Mathematical Society J. Korean Math. Soc. 44 (2007), No. 6, pp. 1383–1396 LFUZZY UNIFORM SPACES
, 2007
"... Abstract. The aim of this paper is to study Lfuzzy uniformizable spaces. A new kind of topological fuzzy remote neighborhood system is defined and used for investigating the relationship between Lfuzzy cotopology and Lfuzzy (quasi)uniformity. It is showed that this fuzzy remote neighborhood sys ..."
Abstract
 Add to MetaCart
Abstract. The aim of this paper is to study Lfuzzy uniformizable spaces. A new kind of topological fuzzy remote neighborhood system is defined and used for investigating the relationship between Lfuzzy cotopology and Lfuzzy (quasi)uniformity. It is showed that this fuzzy remote neighborhood system is different from that in [23] when U is an Lfuzzy quasiuniformity and they will be coincident when U is an Lfuzzy uniformity. It is also showed that each Lfuzzy cotopological space is Lfuzzy quasiuniformizable. 1.
Letter to the Editor ASTRONOMY AND ASTROPHYSICS Chinese models of solar and lunar motions in the 13th century LETTER
, 1998
"... Abstract. In the 13th century, a new Chinese astronomical calculation was just put to use and it was almost entirely included in the calendar of Shoushi (formulated by Guo Shoujing and his colleagues, epoch of AD 1281, adopted from AD 1281−1644). This calendar was one of the most famous and accurat ..."
Abstract
 Add to MetaCart
of the secular variation of the earth’s rotation (Li and Zhang 1997b). 1.
On the Stack Sortable and Pushpopable Permutations
 THE 24TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
"... This work proposes an O(log n) time parallel algorithm for testing whether a permutation is stack sortable or not by O(n) processors under the PRAM EREW computational model. Additionally, the number of permutations which are both stack sortable and pushpopable is also discussed, and an equality is f ..."
Abstract
 Add to MetaCart
This work proposes an O(log n) time parallel algorithm for testing whether a permutation is stack sortable or not by O(n) processors under the PRAM EREW computational model. Additionally, the number of permutations which are both stack sortable and pushpopable is also discussed, and an equality is finally obtained, which combines n!, 2n, Cn, and Un together where Cn is the Catalan number and Un is the number of permutations which are both stack unsortable and unpushpopable.
Finding a Longest Increasing Subsequence from the Paths in a Complete Bipartite Graph
 THE 29TH WORKSHOP ON COMBINATORIAL MATHEMATICS AND COMPUTATION THEORY
"... Let S = s1, s2,..., sn be an integer sequence. The longest increasing subsequence problem is to find an increasing subsequence of S with the longest length. By regarding S as a weight sequence of the vertices in a path, we can redefine the longest increasing subsequence problem on graphs as follows. ..."
Abstract
 Add to MetaCart
Let S = s1, s2,..., sn be an integer sequence. The longest increasing subsequence problem is to find an increasing subsequence of S with the longest length. By regarding S as a weight sequence of the vertices in a path, we can redefine the longest increasing subsequence problem on graphs as follows. Let G = (V, E) be a graph in which every vertex v ∈ V has a weight w(v). A longest increasing subsequence of G is a longest increasing weight subsequence among all paths in G. Thus, the longest increasing subsequence problem on G is to find a longest increasing subsequence of G. In this paper, we present an O(V  log V )time algorithm for finding a longest increasing subsequence of complete bipartite graphs Km,n with m � n.
Results 1  10
of
131