Titlebook: String Processing and Information Retrieval; 18th International S Roberto Grossi,Fabrizio Sebastiani,Fabrizio Silves Conference proceedings

omnibus

IRK

Approximate Point Set Pattern Matching with ,,-Norm, problem. Applications usually ask for not only exact matches between these two sets, but also approximate matches. In this paper, we investigate a one-dimensional approximate point set matching problem proposed in [T. Suga and S. Shimozono, Approximate point set pattern matching on sequences and pl

Exonerate

Detecting Health Events on the Social Web to Enable Epidemic Intelligence,e Flu have caused concern for public health officials. Given the ever increasing pace at which infectious diseases can spread globally, officials must be prepared to react sooner and with greater epidemic intelligence gathering capabilities. Information should be gathered from a broader range of sou

micronized

A Learned Approach for Ranking News in Real-Time Using the Blogosphere,s stories can be ranked automatically in a retrospective manner based upon related discussion within the blogosphere. However, it is as yet undetermined whether blogs are sufficiently fresh to rank stories in real-time. In this paper, we propose a novel learning to rank framework which leverages cur

ALLEY

ANTIC

,Query-Sets + + : A Scalable Approach for Modeling Web Sites,tures which are independent of size, structure and vocabulary. We establish Web site similarity based on search engine query hits, which convey document relevance and utility in direct relation to users’ needs and interests. To achieve this, we use a generic Web site representation scheme over diffe

PRISE

Indexing with Gaps,m . = . . . . . . . . ⋯ . . . ., where ∀ ., . . ∈ Σ. and each . . is a gap length ∈ .. Often one considers these patterns with some bound constraints, for example, all gaps are bounded by a gap-bound ...Near-optimal solutions have, lately, been proposed for the case of one gap only with a predetermi

Albinism

Fast Computation of a String Duplication History under No-Breakpoint-Reuse, algorithm is an efficient implementation of earlier work by Zhang et al. (2009). The motivation of this problem stems from computational biology, in particular from analysis of complex gene clusters. The problem is also related to computing edit distance with block operations, but in our scenario t

一起平行

Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem,ssing each input symbol and takes .(. loglog.) time in total. Our results improve on a previously published algorithm that take .(log.) time per symbol and .(. log.) time in total. The improvements are achieved using a new data structure for the fringe marked ancestor problem, a special case of the

Oscillate