206339726
Soap-HT-BLAST: high throughput BLAST based on Web services
SUMMARY
A high throughput Basic Local Alignment Search Tool (BLAST) system based on Web services is implemented. It provides an alternative BLAST service and allows users to perform multiple BLAST queries at one run in a distributed, parallel environment through the Internet.


AVAILABILITY
It is available at http://mammoth.bii.a-star.edu.sg/webservices/htblast/index.html and at http://www.bii.a-star.edu.sg/jiren/download.html
39144227
Cursive word reference line detection
This paper proposes a novel method in detecting the four reference lines of a cursive word at any skew angle. The proposed method is rotation independent because the detection is based on points determined by their relative positions between the outer contour of a cursive word and its convex hull. Features like bounding box, contour area, convex hull and furthest points are used in detecting and grouping these points. The reference lines are detected by searching for suitable peaks in the Hough transformation space of these points. Encouraging experimental results have been obtained.
1358360
A Web service for efficient ontology comparison
In this paper, we develop a Web service for ontology comparison based on a novel senses refinement algorithm, which builds senses sets to represent the semantics of the input ontologies. The senses refinement algorithm converts the measurement of ontology difference into simple set operations based on set theory, thus ensures the efficiency and accuracy of the ontology comparison. We believe our Web service is the first available online measurement tool for ontology comparison.
34616421
Performance analysis of traffic networks based on Stochastic Timed Petri Net models
A compositional method for modeling and evaluation of performance indices of traffic control systems based on Stochastic Timed Petri Nets (STPN) is presented. We use STPN to specify traffic and traffic control at an intersection and use a random distribution model to model the motion of vehicles in a road segment between any two consecutive intersections. The traffic control system is thus modeled as a composition of individual intersection models and segment distribution models. A technique is presented to incrementally evaluate the system's performance by analyzing intersections separately, according to a carefully selected order. The analysis technique conforms to the accepted practice of transportation research. Compared to existing Petri net models of traffic control systems, our technique dramatically reduces the complexity of analysis.
17750098
Lineage Path Integration for Phylogenetic Resources
With the increase of genome and proteome data, phylogenetic information and phylogenetic analysis tools are increasing greatly in current biological repositories. First, many repositories allow users to browse information about species through taxonomic tools. These tools present the species with its lineage path and links to the various types of information the repository provides about the species. Second, some multiple sequence alignment tools offer users basic phylogenetic data through applying basic reconstruction algorithms to the alignment. With the availability of this information in multiple locations, integrated tools are needed to allow the user to compare this data. This paper presents data integration research on lineage paths using the BIO-AJAX framework. It introduces BIO-AJAX for Lineage Paths, a tool that integrates lineage path information for NCBI Taxonomy Database [1] and the Integrated Taxonomic Information System (ITIS)[6].
42707225
A Web-based Course in English as a Second Language: A Case Study
14697648
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees
Ordered, labeled trees are trees in which each node has a label and the left-to-right order of its children (if it has any) is fixed. Such trees have many applications in vision, pattern recognition, molecular biology and natural language processing. We consider a substructure of an ordered labeled tree T to be a connected subgraph of T. Given two ordered labeled trees T/sub 1/ and T/sub 2/ and an integer d, the largest approximately common substructure problem is to find a substructure U/sub 1/ of T/sub 1/ and a substructure U/sub 2/ of T/sub 2/ such that U/sub 1/ is within edit distance d of U/sub 2/ and where there does not exist any other substructure V/sub 1/ of T/sub 1/ and V/sub 2/ of T/sub 2/ such that V/sub 1/ and V/sub 2/ satisfy the distance constraint and the sum of the sizes of V/sub 1/ and V/sub 2/ is greater than the sum of the sizes of U/sub 1/ and U/sub 2/. We present a dynamic programming algorithm to solve this problem, which runs as fast as the fastest known algorithm for computing the edit distance of two trees when the distance allowed in the common substructures is a constant independent of the input trees. To demonstrate the utility of our algorithm, we discuss its application to discovering motifs in multiple RNA secondary structures (which are ordered labeled trees).