#### Filter Results:

- Full text PDF available (87)

#### Publication Year

1971

2018

- This year (10)
- Last 5 years (43)
- Last 10 years (96)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### 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â€¦ (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â€¦ (More)

- Donghui Chen, Ding-Zhu Du, Xiaodong Hu, Guohui Lin, Lusheng Wang, Guoliang Xue
- J. Global Optimization
- 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â€¦ (More)

- Guohui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen
- ICALP
- 2001

Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The Longest Arc-Preserving Common Subsequence (LAPCS) Problem has been introduced in Evansâ€¦ (More)

- 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â€¦ (More)

- Guohui Lin, Guoliang Xue
- COCOON
- 1999

- 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â€¦ (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â€¦ (More)

- Zhipeng Cai, Maysam Heydari, Guohui Lin
- J. Bioinformatics and Computational Biology
- 2006

Microarray gene expression data often contains multiple missing values due to various reasons. However, most of gene expression data analysis algorithms require complete expression data. Therefore,â€¦ (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â€¦ (More)