Database searching is a main method for protein identification in shotgun proteomics, and till now most research effort is dedicated to improve its effectiveness. However, the efficiency of database searching is facing a serious challenge, due to the ever fast increasing of protein and peptide databases resulting from genome translations, enzymatic digestions, and post-translational modificatio...

Traditional parallel single string matching algorithms are always based on PRAM computation model. Those algorithms concentrate on the cost optimal design and the theoretical speed. Based on the distributed string matching algorithm proposed by CHEN, a practical distributed string matching algorithm architecture is proposed in this paper. And also an improved single string matching algorithm ba...

The Asian citrus psyllid, Diaphorina citri Kuwayama (Hemiptera: Liviidae), vectors the bacterium causing citrus greening disease, which has devastated citrus production worldwide wherever it has been introduced. To help monitor and target D. citri populations in commercial groves, thereby facilitating more effective management of citrus greening disease, a prototype device has been developed th...

A set of n colored objects (points/hyperboxes) lie in IR and given a query orthogonal range q, we need to report the distinct colors of the objects in S ∩ q. In a scenarto where these colored objects also come associated with a weight, for each distinct color c of the objects in S ∩ q, the tuple < c, F(c) > where F(c) is the object of color c with the maximum weight is reported.

We present new general techniques for static orthogonal range searching problems in two and higher dimensions. For the general range reporting problem in , we achieve query time using space , where denotes the number of stored points and the number of points to be reported. For the range reporting problem on an ! " grid, we achieve query time # $ % & using space ' ( . For the two-dimensional se...

Citation searching has been available for decades, although in a limited form. This article discusses the advantages and limitations of searching by cited references, and also some alternatives in searching for cited references, before presenting a case study involving citation searching in full-text indexes.

In this paper we consider range-aggregate query problems wherein we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain aggregation function on the objects S′ = S ∩ q can be answered efficiently. Range-aggregate version of point enclosure queries, 1-d segment intersection, 2-d orthogonal segment intersection (with/without distance constraint) ar...

As databases increasingly integrate non-textual information it is becoming necessary to support eecient similarity searching in addition to range searching. Recently, declustering techniques have been proposed for improving the performance of similarity searches through parallel I/O. In this paper, we propose a new scheme which provides good declus-tering for similarity searching. In particular...