#### Filter Results:

- Full text PDF available (20)

#### Publication Year

2002

2017

- This year (1)
- Last 5 years (16)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Chung-Shou Liao, Kanghao Lu, Michael Baym, Rohit Singh, Bonnie Berger
- Bioinformatics
- 2009

MOTIVATION
With the increasing availability of large protein-protein interaction networks, the question of protein network alignment is becoming central to systems biology. Network alignment is further delineated into two sub-problems: local alignment, to find small conserved motifs across networks, and global alignment, which attempts to find a bestâ€¦ (More)

- Daniel Park, Rohit Singh, Michael Baym, Chung-Shou Liao, Bonnie Berger
- Nucleic Acids Research
- 2011

We describe IsoBase, a database identifying functionally related proteins, across five major eukaryotic model organisms: Saccharomyces cerevisiae, Drosophila melanogaster, Caenorhabditis elegans, Mus musculus and Homo Sapiens. Nearly all existing algorithms for orthology detection are based on sequence comparison. Although these have been successful inâ€¦ (More)

- Leonid Chindelevitch, Chung-Shou Liao, Bonnie Berger
- Pacific Symposium on Biocomputing
- 2010

We propose a novel algorithm, PISwap, for computing global pairwise alignments of protein interaction networks, based on a local optimization heuristic that has previously demonstrated its effectiveness for a variety of other NP-hard problems, such as the Traveling Salesman Problem. Our algorithm begins with a sequence-based network alignment and thenâ€¦ (More)

- Chung-Shou Liao, Gerard J. Chang
- Inf. Process. Lett.
- 2003

In a graph G, a vertex is said to dominate itself and all of its neighbors. For a fixed positive integer k, the k-tuple domination problem is to find a minimum sized vertex subset in a graph such that every vertex in the graph is dominated by at least k vertices in this set. The current paper studies k-tuple domination in graphs from an algorithmic point ofâ€¦ (More)

- Leonid Chindelevitch, Cheng-Yu Ma, Chung-Shou Liao, Bonnie Berger
- Bioinformatics
- 2013

MOTIVATION
The global alignment of protein interaction networks is a widely studied problem. It is an important first step in understanding the relationship between the proteins in different species and identifying functional orthologs. Furthermore, it can provide useful insights into the species' evolution.
RESULTS
We propose a novel algorithm, PISwap,â€¦ (More)

- Chung-Shou Liao
- J. Comb. Optim.
- 2016

- Chung-Shou Liao, Louxin Zhang
- Int. J. Found. Comput. Sci.
- 2009

- Chung-Shou Liao, Chin Chin Lee
- COCOON
- 2005

To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in graph theory. A set S is a power dominating set (PDS) of a graph G = (V,E), if every vertex and every edge in the system is observed following the observation rules of power systemâ€¦ (More)

- Po-Jung Huang, Chi-Ching Lee, +9 authors Petrus Tang
- Human mutation
- 2015

Next-generation sequencing (NGS) technologies have revolutionized the field of genetics and are trending toward clinical diagnostics. Exome and targeted sequencing in a disease context represent a major NGS clinical application, considering its utility and cost-effectiveness. With the ongoing discovery of disease-associated genes, various gene panels haveâ€¦ (More)

- Yu-Shin Chen, Chin Chin Lee, Chung-Shou Liao
- Int. J. Comput. Geometry Appl.
- 2005

In this paper, we consider a map labeling problem where the points to be labeled are restricted on a line. It is known that the 1d-4P and the 1d-4S unit-square label placement problem and the Slope-4P unit-square label placement problem can both be solved in linear time and the Slope-4S unit-square label placement problem can be solved in quadratic time inâ€¦ (More)