#### Filter Results:

#### Publication Year

2002

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Fang Rong Hsu, Hwan-You Chang, Yaw-Lin Lin, Yin-Te Tsai, Hui-Ling Peng, Ying Tsong Chen +4 others
- Bioinformation
- 2005

UNLABELLED
In the past years, identification of alternative splicing (AS) variants has been gaining momentum. We developed AVATAR, a database for documenting AS using 5,469,433 human EST sequences and 26,159 human mRNA sequences. AVATAR contains 12000 alternative splicing sites identified by mapping ESTs and mRNAs with the whole human genome sequence.… (More)

- Fang Rong Hsu, Wei-Chung Shia, J. F. Chen, Fang Ming Hsu
- 2007

As a great number of the genomic DNA sequences can now be generated in a day, the demand for a very fast and accurate method for positioning genomic DNA sequences on a genome is high. A unique marker is a sequence which appears only once in a genome. The unique marker method is an efficient method to perform this task. The amount of time needed for… (More)

Among 75218 splicing sites, 137 colon cancer specific alternative splicing isoforms were found by mining EST database. Alternative splicing database were first constructed by aligning EST to genomic sequence. Numbers of ESTs from normal or cancer colon tissue supporting splicing isoform at each splicing site were then queried and analyzed with Fisher exact… (More)

In this paper, we propose an algorithm for hiding (DNA Deoxyribonucleic acid) sequence in H.264/AVC video. The DNA sequence is first encrypted by a rule before hiding, and then we embed encrypted DNA sequence into the quantized discrete cosine transform (QDCT) coefficients of the 4x4 macroblocks (MBs) of Intra-frames (I-frames). To avert the distortion… (More)

- F. R. Hsu
- 2006

In this paper, we consider some shortest path related problems on interval and circular-arc graphs. For the all-pair shortest path query problem on interval and circular-arc graphs, instead of using the sophisticated technique, we propose simple parallel algorithms using only the parallel prefix and suffix computations and the Euler tour technique. Our… (More)

- F. R. Hsu, M. K. Shan
- 2002

A connected domination set of a graph is a set of vertices such that every vertex not in is adjacent to and the induced subgraph of is connected. The minimum connected domination set of a graph is the connected domination set with the minimum number of vertices. In this paper, we propose parallel algorithms for finding the minimum connected domination set… (More)

- ‹
- 1
- ›