#### Filter Results:

#### Publication Year

2007

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Jia Jie Liu, Yue-Li Wang, Richard C. T. Lee
- J. Complexity
- 2008

In this paper, we propose an O(min{mN, Mn}) time algorithm for finding a longest common subsequence of strings X and Y with lengths M and N, respectively, and run-length-encoded lengths m and n, respectively. We propose a new recursive formula for finding a longest common subsequence of Y and X which is in the run-length-encoded format. That is, Y =y 1 y 2… (More)

- Jia Jie Liu, Guan-Shieng Huang, Yue-Li Wang, Richard C. T. Lee
- Inf. Process. Lett.
- 2007

- Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang, William Chung-Kung Yen
- Theory Comput. Syst.
- 2011

- Guan-Shieng Huang, Jia Jie Liu, Yue-Li Wang
- COCOON
- 2008

A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) space, for two strings of lengths m and n, with m and n runs, respectively. We assume the linear-gap model and make no assumption on the scoring matrices, which maximizes the… (More)

- Chien-Hung Lin, Jia Jie Liu, Yue-Li Wang
- Theory of Computing Systems
- 2012

A strong alliance in a graph G=(V,E) is a set of vertices S⊆V satisfying the condition that, for each v∈S, the number of its neighbors, including itself, in S is greater than the number of those neighbors not in S. A strong alliance S is global if S forms a dominating set of G. In this paper, we shall propose a way for finding a minimum global strong… (More)

- Jia Jie Liu, Yue-Li Wang, Yu-shan Chiu
- Comput. J.
- 2015

- Chih-En Kuo, Yue-Li Wang, Jia Jie Liu, Ming-Tat Ko
- Algorithmica
- 2013

Given a set S={S 1,S 2,…,S l } of l strings, a text T, and a natural number k, find a string M, which is a concatenation of k strings (not necessarily distinct, i.e., a string in S may occur more than once in M) from S, whose longest common subsequence with T is largest, where a string in S may occur more than once in M. Such a string is called a k-inlay.… (More)

- Jia Jie Liu, Yue-Li Wang
- Inf. Sci.
- 2014

- Shun-Chieh Chang, Jia Jie Liu, Yue-Li Wang
- Theory of Computing Systems
- 2015

An outer-connected dominating set in a graph G = (V, E) is a set of vertices D ⊆ V satisfying the condition that, for each vertex v ∉ D, vertex v is adjacent to some vertex in D and the subgraph induced by V∖D is connected. The outer-connected dominating set problem is to find an outer-connected dominating set with the minimum number of vertices which is… (More)

- Jia Jie Liu, William Chung-Kung Yen, Yen-Ju Chen
- Comput. J.
- 2011