Titlebook: Combinatorial Pattern Matching; 19th Annual Symposiu Paolo Ferragina,Gad M. Landau Conference proceedings 2008 Springer-Verlag Berlin Heide

提煉

Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statisticse the distribution of the results obtained by such probabilistic calculations. Although we introduce PAAs and the corresponding algorithm in a generic manner, our main concern is their application to pattern matching statistics, i.e. we study the distributions of the number of occurrences of a patte

SPURN

積極詞匯

Approximate String Matching with Address Bit Errors the setting where errors are introduced to the location component (.), rather than the more traditional setting, where errors are introduced to the content itself (..). In this paper, we consider the case where bits of . may be erroneously flipped, either in a consistent or transient manner. We for

橢圓

按時(shí)間順序

fatuity

郊外

On Compact Representations of All-Pairs-Shortest-Path-Distance Matricesins integers in [.]?∪?+?∞, its plain storage takes ..log(.?+?1) bits. However, a simple counting argument shows that (..???.)/2 bits are necessary to store .. In this paper we investigate the question of finding a succinct representation of . that requires .(..) bits of storage and still supports co

BLANC

Computing Inverse ST in Linear Complexityts. However, the best result obtained so far for the inverse ST has a time complexity .(.log.) and a space complexity .(.), where . and . are the text size and the context order of the transform, respectively. In this paper, we present a novel algorithm that can compute the inverse ST in an .(.) tim

Calibrate

啞巴