A fundamental problem arising in the evolutionary molecular biology is to discover the locations of gene duplications and multiple gene duplication episodes based on the phylogenetic information. Theâ€¦ (More)

Katriel and Bodlaender [7] modify the algorithm proposed by Alpern et al. [2] for maintaining the topological order of the n nodes of a directed acyclic graph while inserting m edges and prove thatâ€¦ (More)

Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In this paper, we proposeâ€¦ (More)

Quasi-biclique mining for bipartite graphs has found important applications in providing security services. However, the standard MapReduce algorithm for mining quasi-bicliques does not scale wellâ€¦ (More)

Given a sequence A of n real numbers and two positive integers l andÂ k, where $k\leq \frac{n}{l}$ , we study the problem of locating k disjoint segments ofÂ A, each of length at leastÂ l, such that theâ€¦ (More)

UNLABELLED
CNVDetector is a program for locating copy number variations (CNVs) in a single genome. CNVDetector has several merits: (i) it can deal with the array comparative genomic hybridizationâ€¦ (More)

We present an Ã•(n)-time algorithm for maintaining the topological order of a directed acyclic graph with n vertices while inserting m edges. This is an improvement over the previous result of O(n) byâ€¦ (More)

In this work, we obtain the following new results. Given a sequence D = ((h1, s1), (h2, s2) . . . , (hn, sn)) of number pairs, where si > 0 for all i, and a number Lh, we propose an O(n)-timeâ€¦ (More)