|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Prevalence of polycystic ovary syndrome in women in China: a large community-based study显示文摘 | Rong Li Qiufang Zhang Dongzi Yang Shangwei Li Shulan Lu Xiaoke Wu Zhaolian Wei Xueru Song Xiuxia Wang Shuxin Fu Jinfang Lin Yimin Zhu Yong Jiang Huai L. Feng Jie Qiao | 2013 | Human Reproduction2013，，9： | 4 |
| 2 | DNA labelled graphs with DNA computing显示文摘Let k≥2, 1≤i≤k andα≥1 be three integers. For any multiset which consists of some k-long oligonucleotides, a DNA labelled graph is defined as follows: each oligonucleotide from the multiset becomes a point; two points are connected by an arc from the first point to the second one if the i rightmost uucleotides of the first point overlap with the i leftmost nucleotides of the second one. We say that a directed graph D can be(k, i;α)-labelled if it is possible to assign a label(l1(x),..., lk(x))to each point x of D such that lj(x)∈{0,...,a-1}for any j∈{1,...,k}and(x,y)∈E(D)if and only if(lk-i+1(x),..., lk(x))=(l1(y),..., li(y)). By the biological background, a directed graph is a DNA labelled graph if there exist two integers k, i such that it is(k, i; 4)-labelled. In this paper, a detailed discussion of DNA labelled graphs is given. Firstly, we study the relationship between DNA labelled graphs and some existing directed graph classes. Secondly, it is shown that for any DNA labelled graph, there exists a positive integer i such that it is(2i, i; 4)-labelled. Furthermore, the smallest i is determined, and a polynomial-time algorithm is introduced to give a(2i, i; 4)-labelling for a given DNA labelled graph. Finally, a DNA algorithm is given to find all paths from one given point to another in a(2i, i; 4)-labelled directed graph. | WANG ShiYing YUAN Jun LIN ShangWei | 2008 | Science China Mathematics2008，51，3： | 2 |
| 3 | Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2显示文摘 | WANG SHIYING LIN SHANGWEI LI CHUNFANG | 2009 | Discrete Math2009，309，4： | 1 |
| 4 | Sufficient conditions for a graph to be super restricted edge-connected 显示文摘 | WANG Shiying LIN Shangwei | 2008 | Journal Net- works2008，51，3： | 1 |
| 5 | V-optimal digraphs显示文摘 | Wang Shiying Lin Shangwei | 2008 | Information Processing Letters2008，108，6： | 1 |
| 6 | Matching preclusion for k-ary n-cubes显示文摘 | Wang Shiying Wang Ruixia Lin Shangwei Li Jing | 2010 | Discrete Applied Mathematics2010，158，18： | 1 |
| 7 | Matching preclusion for k-ary n-cubes显示文摘 | Wang Shiyin Wang Ruixia Lin Shangwei | 2010 | Discrete Applied Mathematics2010，158，18： | 1 |
| 8 | Hamiltonian Cycles Passing Through Linear Forests in k -ary n -cubes显示文摘 | Shiying Wang Yuxing Yang Jing Li Shangwei Lin | 2011 | Discrete Aoolied2011，15，91： | 1 |
| 9 | Sufficient conditions {or super k-restricted edge connectivity in graphs of diame- ter 2显示文摘 | WANG Shiying LIN Shangwei LI ChunIang | 2009 | Discrete Mathematics2009，309，9： | 1 |
| 10 | Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2显示文摘 | Wang Shiying Lin Shangwei Li Chunfang | 2009 | Discrete Mathematics2009，304，4： | 1 |
| 11 | Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges 显示文摘 | LI JING WANG SHIYING LIU DI LIN SHANGWEI | 2011 | Information Science2011，181，11： | 1 |
| 12 | Sufficient conditions for super-k-restricted edge connectivity in graphs of diameter 2 显示文摘 | WANG SHIYING LIN SHANGWEI LI CHUNFANG | 2009 | Discrete Mathematics2009，309，4： | 1 |
| 13 | Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements 显示文摘 | LIN SHANGWEI WANG SHIYING | 2011 | Discrete Applied Mathematics2011，159，： | 1 |
| 14 | The k-restricted edge connectivity of undirected Kautz graphs显示文摘 | Wang Shiying Lin Shangwei | 2009 | Discrete Mathematics2009，309，13： | 1 |
| 15 | A Neighborhood Condition for Graphs to be Maximally k-restricted Edge Con- nected显示文摘 | Wang Shiying Zhang Lei Lin Shangwei | 2012 | Information Processing Letters2012，112，3： | 1 |
| 16 | Sufficient Conditions for Super k-restricted Edge Connectivity in Graphs of Di- ameter 2显示文摘 | Wang Shiying Lin Shangwei Li Chunfang | 2009 | Discrete Mathematics2009，309，4： | 1 |
| 17 | Sufficient conditions for super k -restricted edge connectivity in graphs of diameter 2 显示文摘 | Wang Shiying Lin Shangwei Li Chunfang | 2009 | Discrete Mathematics2009，309，4： | 1 |
| 18 | Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements显示文摘 | Lin Shangwei Wang Shiying Li Chunfang | 2011 | Discrete Applied Mathematics2011，159，4： | 1 |
| 19 | The k-restricted edge connectivity of undirected Kautz graphs显示文摘 | Wang Shiying Lin Shangwei | 2009 | Discrete Mathematics2009，309，4： | 1 |
| 20 | Influence of the particle size on the electrochemical properties of lithium manganese oxide显示文摘 | Lu Chung-Hsin Lin Shangwei | 2001 | Journal of Power Sources2001，9798，： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员