#### Filter Results:

- Full text PDF available (109)

#### Publication Year

1997

2017

- This year (9)
- Last 5 years (48)
- Last 10 years (96)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- Guohui Lin, Guoliang Xue
- Inf. Process. Lett.
- 1999

In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STPMSPBEL), which asks for a tree interconnecting a given set of n terminal points and a minimum number of Steiner points such that the Euclidean length of each edge is no more than a given positive constant. This problem has applications in VLSI… (More)

- Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang
- Journal of Computational Biology
- 2002

Arc-annotated sequences are useful in representing the structural information of RNA sequences. In general, RNA secondary and tertiary structures can be represented as a set of nested arcs and a set of crossing arcs, respectively. Since RNA functions are largely determined by molecular confirmation and therefore secondary and tertiary structures, the… (More)

- Donghui Chen, Ding-Zhu Du, Xiao-Dong Hu, Guohui Lin, Lusheng Wang, Guoliang Xue
- Theor. Comput. Sci.
- 2000

Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more than the given positive constant. This problem is NP-hard with applications in VLSI design, WDM optical networks and wireless communications. In… (More)

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

- Guohui Lin, Guoliang Xue
- COCOON
- 1999

- Kun Yang, Zhipeng Cai, Jianzhong Li, Guohui Lin
- BMC Bioinformatics
- 2005

Microarray data analysis is notorious for involving a huge number of genes compared to a relatively small number of samples. Gene selection is to detect the most significantly differentially expressed genes under different conditions, and it has been a central research focus. In general, a better gene selection method can improve the performance of… (More)

- Guohui Lin, Guoliang Xue
- Inf. Process. Lett.
- 2002

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio ρ + 2, where ρ is the best-known approximation ratio for… (More)

- Guohui Lin, Tao Jiang, Paul E. Kearney
- ISAAC
- 2000

Given a graph G = (V; E) and a positive integer k, the Phylogenetic k-Root Problem asks for a (unrooted) tree T without degree-2 nodes such that its leaves are labeled by V and (u; v) 2 E if and only if dT (u; v) k. If the vertices in V are also allowed to be internal nodes in T , then we have the Steiner k-Root Problem. Moreover, if a particular subset S… (More)

- Xiaomeng Wu, Zhipeng Cai, Xiu-Feng Wan, Tin Hoang, Randy Goebel, Guohui Lin
- Bioinformatics
- 2007

MOTIVATION
The availability of the whole genomic sequences of HIV-1 viruses provides an excellent resource for studying the HIV-1 phylogenies using all the genetic materials. However, such huge volumes of data create computational challenges in both memory consumption and CPU usage.
RESULTS
We propose the complete composition vector representation for an… (More)

- 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)