Titlebook: Combinatorial Pattern Matching; 14th Annual Symposiu Ricardo Baeza-Yates,Edgar Chávez,Maxime Crochemore Conference proceedings 2003 Springe

Incorporate

On Minimizing Pattern Splitting in Multi-track String Matching, study some variations of this minimum splitting problem, such as splittings with limited gaps and transposition invariance, and show how to use sparse dynamic programming to solve the variations efficiently. In particular, we show that the minimum splitting problem can be interpreted as a shortest path problem on line segments.

BET

Fast Lightweight Suffix Array Construction and Checking,thm is to first sort a sample of suffixes chosen using mathematical constructs called difference covers. The algorithm is not only lightweight but also fast in practice as demonstrated by experiments. Additionally, we describe fast and lightweight suffix array checkers, i.e., algorithms that check the correctness of a suffix array.

不溶解

Linear-Time Construction of Suffix Arrays,ix trees as intermediate data structures during its construction. Since the case of a constant-size alphabet can be subsumed in that of an integer alphabet, our result implies that the time complexity of directly constructing suffix arrays matches that of constructing suffix trees.

虚度

Lei Chen,Xiao-Qian Ma,Wei Shangime and .(. .) in space where . is the size of the maps. In this paper we propose a more efficient algorithm using the same evolutionary model which is .(. .) in time and .(. .) in space. Our algorithm with this better efficiency can even solve generalized and more refined models.

circumvent

功多汁水

修正案

Xiao Liu,Jing Liu,Hsinchun Chenthan the previous ones, and achieves running time which is equal to the best known. Moreover, the analysis of the algorithm is significantly less involved, and provides a good starting point for studying related open problems.

Ornithologist

Smart Health rechtsverträglich gestaltetithm for suffix sorting, which takes .(. log .) time. We also show how to construct suffix trees in linear time from our suffix sorting result. Apart from being simple and applicable for alphabets not necessarily of fixed size, this method of constructing suffix trees is more space efficient.

THROB

点燃