Yaw-g Lin

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U, find a consecutive subsequence of length at most U with the maximum sum and (ii) given a sequence of real numbers of length n and a lower bound L, find a consecutive subsequence of length at least L with the maximum average. We present an O(n)-time algorithm for the first problem and an O(n log L)-time algorithm for the second. The algorithms have potential applications in several areas of biomolecular sequence analysis including locating GC-rich regions in a genomic DNA sequence, post-processing sequence alignments, annotating multiple sequence alignments, and computing length-constrained ungapped local alignment. Our preliminary tests on both simulated and real data demonstrate that the algorithms are very efficient and able to locate useful (such as GC-rich) regions.

Algorithms for Square Roots of Graphs

The

Implementation of a Parallel Protein Structure Alignment Service on Cloud

n

COMPLEXITY ASPECTS OF VISIBILITY GRAPHS

th power (

Novel and efficient tag SNPs selection algorithms

n \geq 1

Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis

) of a graph

Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs

G = (V, E)

The on-line first-fit algorithm for radio frequency assignment problems

, written

Performance issues of grid computing based on different architecture cluster computing platforms

G^n

The application of alternative splicing graphs in quantitative analysis of alternative splicing form from EST database

, is defined to be the graph having