Titlebook: Combinatorial Pattern Matching; 21st Annual Symposiu Amihood Amir,Laxmi Parida Conference proceedings 2010 Springer-Verlag Berlin Heidelber

Disperse

书目名称Combinatorial Pattern Matching影响因子(影响力)




书目名称Combinatorial Pattern Matching影响因子(影响力)学科排名




书目名称Combinatorial Pattern Matching网络公开度




书目名称Combinatorial Pattern Matching网络公开度学科排名




书目名称Combinatorial Pattern Matching被引频次




书目名称Combinatorial Pattern Matching被引频次学科排名




书目名称Combinatorial Pattern Matching年度引用




书目名称Combinatorial Pattern Matching年度引用学科排名




书目名称Combinatorial Pattern Matching读者反馈




书目名称Combinatorial Pattern Matching读者反馈学科排名

Malcontent

Affine Image Matching Is Uniform ,-Complete,arch in combinatorial pattern matching led to a polynomial time algorithm which solves this problem by a sophisticated search in the set . of all affine transformations of .. This paper shows that polynomial time is not the lowest complexity class containing this problem by providing its .-completen

谦虚的人

Old and New in Stringology, of the talk will revisit the list. Some problems were solved, others were partially solved and some resisted any progress..The second part of the talk will review some recent results in Stringology, namely algorithms in the streaming model. In this model, the algorithms cannot store the entire inpu

同步信息

Small-Space 2D Compressed Dictionary Matching,ssed form. In this paper we introduce the 2-dimensional compressed dictionary matching problem in Lempel-Ziv compressed images, and present an efficient solution for patterns whose rows are all .. Given . patterns, each of (uncompressed) size . ×., and a text of (uncompressed) size . ×., all in 2D-L

江湖骗子

Bidirectional Search in a String with Wavelet Trees,e) is highly conserved, the genes encoding it can be determined by finding regions in a genomic DNA sequence that match the structure. It is known that algorithms using a bidirectional search on the DNA sequence for this task outperform algorithms based on unidirectional search. The data structures

惰性气体

A Minimal Periods Algorithm with Applications, in a word. Using the same construction of suffix trees, we generalize his result and describe in detail how to compute the minimal . power, with a period of length longer than ., starting at each position in a word . for arbitrary exponent .> 1 and integer . ≥ 0. The algorithm runs in .(.|.|)-time

惰性气体

The Property Suffix Tree with Dynamic Properties,phabet Σ (which we assume is of constant size), and a set of intervals . over the text positions, such that give a query pattern . of size . we can report all of the occurrences of . in . which are completely contained within some interval from .. This type of matching is extremely helpful in scenar

推崇

Banquet

有机体

On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs,melin, Rosamond, and Vialette. We also give an FPT algorithm for .. in .-interval graphs, parameterized by both . and ., with running time max { .., 2. } ·poly(.), where . is the number of vertices in the graph. This slightly improves the previous FPT algorithm by Fellows, Hermelin, Rosamond, and Vi