Jointly parsing two languages has been shown to improve accuracies on either or both sides. However, its search space is much bigger than the monolingual case, forcing existing ap...
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
This paper investigates the performance of machine learning methods for classifying rock types from hyperspectral data. The main objective is to test the impact on classification ...
This paper integrates the signal, context and structure features for genome-wide promoter recognition, which is critical in many DNA sequence analysis tasks. First, CpG islands ar...
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...