[图书][B] Analytic pattern matching: from DNA to Twitter
P Jacquet, W Szpankowski - 2015 - books.google.com
How do you distinguish a cat from a dog by their DNA? Did Shakespeare really write all of
his plays? Pattern matching techniques can offer answers to these questions and to many …
his plays? Pattern matching techniques can offer answers to these questions and to many …
Profiles of tries
G Park, HK Hwang, P Nicodeme… - SIAM Journal on …, 2009 - SIAM
Tries (from re trie val) are one of the most popular data structures on words. They are
pertinent to the (internal) structure of stored words and several splitting procedures used in …
pertinent to the (internal) structure of stored words and several splitting procedures used in …
The total path length of split trees
N Broutin, C Holmgren - The Annals of Applied Probability, 2012 - JSTOR
We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999)
409-432]. The model encompasses many important randomized algorithms and data …
409-432]. The model encompasses many important randomized algorithms and data …
Profile of tries
G Park, HK Hwang, P Nicodème… - LATIN 2008: Theoretical …, 2008 - Springer
The profile of a trie, the most popular data structures on words, is a parameter that
represents the number of nodes (either internal or external) with the same distance to the …
represents the number of nodes (either internal or external) with the same distance to the …
Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries
W Schachinger - SIAM Journal on Computing, 2004 - SIAM
In this paper we study the costs CN of partial match retrievals in K-dimensional tries (Kd
tries), constructed from N records. The probabilistic model that we assume is the asymmetric …
tries), constructed from N records. The probabilistic model that we assume is the asymmetric …