#### Filter Results:

- Full text PDF available (59)

#### Publication Year

1989

2017

- This year (4)
- Last 5 years (30)
- Last 10 years (52)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Key Phrases

#### Method

#### Organism

Learn More

- Zhi-Zhong Chen, Seinosuke Toda
- Structure in Complexity Theory Conference
- 1993

- Qing Yang, Zhi-Zhong Chen, +6 authors Zhizhong Gong
- Molecular plant
- 2009

Soil salinity is a major abiotic stress that decreases plant growth and productivity. Recently, it was reported that plants overexpressing AtNHX1 or SOS1 have significantly increased salt tolerance. To test whether overexpression of multiple genes can improve plant salt tolerance even more, we produced six different transgenic Arabidopsis plants that… (More)

- Guohui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen
- J. Comput. Syst. Sci.
- 2001

- Zhi-Zhong Chen, Tao Jiang, Guohui Lin
- WADS
- 2001

Given a set of species and their similarity data, an important problem in evolutionary biology is how to reconstruct a phylogeny (also called evolutionary tree) so that species are close in the phylogeny if and only if they have high similarity. Assume that the similarity data are represented as a graph G = (V,E) where each vertex represents a species and… (More)

- Zhi-Zhong Chen, Yuusuke Okamoto, Lusheng Wang
- Inf. Process. Lett.
- 2005

We present an O(n)-time approximation algorithm for the maximum traveling salesman problem whose approximation ratio is asymptotically 61 81 , where n is the number of vertices in the input complete edge-weighted (undirected) graph. We also present an O(n)-time approximation algorithm for the metric case of the problem whose approximation ratio is… (More)

- Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
- Algorithmica
- 2005

We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at most four countries meet at any point.

- Zhi-Zhong Chen, Ming-Yang Kao
- STOC
- 1997

We propose a general methodology for testing whether a polynomial with integer coefficients is identically zero. The methodology is to evaluate the polynomial at suitable approximations of easily computable irrational points. An innovative feature of the methodology is that the error probability of the testing algorithm can be decreased by increasing the… (More)

The problem of computing a matching of maximum weight in a given edge-weighted graph is not known to be P-hard or in RNC. This paper presents four parallel approximation algorithms for this problem. The first is an RNC-approximation scheme, i.e., an RNC algorithm that computes a matching of weight at least 1 − times the maximum for any given constant > 0.… (More)

- Zhi-Zhong Chen, Michael R. Fellows, +4 authors Binhai Zhu
- AAIM
- 2010

- Zhi-Zhong Chen, Lusheng Wang
- Bioinformatics
- 2010

MOTIVATIONS
When reticulation events occur, the evolutionary history of a set of existing species can be represented by a hybridization network instead of an evolutionary tree. When studying the evolutionary history of a set of existing species, one can obtain a phylogenetic tree of the set of species with high confidence by looking at a segment of… (More)