#### Filter Results:

- Full text PDF available (11)

#### Publication Year

2000

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Luhan Yang, Marc Guell, +10 authors George M Church
- Nucleic acids research
- 2013

Efficient strategies for precise genome editing in human-induced pluripotent cells (hiPSCs) will enable sophisticated genome engineering for research and clinical purposes. The development of programmable sequence-specific nucleases such as Transcription Activator-Like Effectors Nucleases (TALENs) and Cas9-gRNA allows genetic modifications to be made more… (More)

- Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu
- Eur. J. Comb.
- 2012

- Harris H. Wang, Po-Yi Huang, +7 authors George M. Church
- ACS synthetic biology
- 2012

Protein pathways are dynamic and highly coordinated spatially and temporally, capable of performing a diverse range of complex chemistries and enzymatic reactions with precision and at high efficiency. Biotechnology aims to harvest these natural systems to construct more advanced in vitro reactions, capable of new chemistries and operating at high yield.… (More)

- Po-Yi Huang, Lih-Hsing Hsu
- Appl. Math. Lett.
- 2011

A k-container of G between u and v, C(u, v), is a set of k internally disjoint paths between u and v. A k-container C(u, v) of G is a k-container if it contains all vertices of G. A graph G is k-connected if there exists a k-container between any two distinct vertices. Thus, every 1-connected graph is Hamiltonian connected. Moreover, every 2-connected graph… (More)

- Po-Yi Huang, Tsai-Lien Wong, Xuding Zhu
- Discrete Mathematics
- 2012

- Po-Yi Huang, Jun Ma, Yeong-Nan Yeh
- Electr. J. Comb.
- 2010

Let ~r = (ri) n i=1 be a sequence of real numbers of length n with sum s. Let s0 = 0 and si = r1 + . . . + ri for every i ∈ {1, 2, . . . , n}. Fluctuation theory is the name given to that part of probability theory which deals with the fluctuations of the partial sums si. Define p(~r) to be the number of positive sum si among s1, . . . , sn and m(~r) to be… (More)

- Yu-Jen Hsu, Kuan-Hung Chen, Po-Yi Huang, Chan-Nan Lu
- IEEE Trans. Instrumentation and Measurement
- 2011

- Jiun-Ming Chen, Shoou-I Yu, +5 authors Chi-Sung Laih
- 2008

In 1999, the 512-bit number of 155 digits taken from the RSA Challenge list was first factored by the General Number Field Sieve. This work was done on a supercomputer and about 300 PCs or workstations by 17 experts all over the world. The calendar time for the factorization was over 6 months. Based on the open source GGNFS, we improved its algorithms and… (More)

- Po-Yi Huang, Po-Yi Huang
- 2006

In this paper, under a mild hypothesis, we prove a conjecture of Gross for the Stickelberger element of the maximal abelian extension over the rational function field unramified outside a set of four degree-one places.

The conceptions of G-parking functions and G-multiparking functions were introduced in [15] and [12] respectively. In this paper, let G be a connected graph with vertex set {1, 2, . . . , n} and m ∈ V (G). We give the definition of (G,m)-multiparking function. This definition unifies the conceptions of G-parking function and G-multiparking function. We… (More)