Name
Abstract | ||
|---|---|---|
The string correction factor is the term by which the prob- ability of a word w needs to be multiplied in order to account for char- acter changes or \errors" occurring in at most k arbitrary positions in that word. The behavior of this factor, as a function of k and of the word length, has implications on the number of candidates that need to be considered and weighted when looking for subwords of a sequence that present unusually recurrent replicas within some bounded number of mismatches. Speciflcally, it is seen that over intervals of mono- or bi- tonicity for the correction factor, only some of the candidates need be considered. This mitigates the computation and leads to tables of over- represented words that are more compact to represent and inspect. In recent work, expectation and score monotonicity has been established for a number of cases of interest, under i.i.d. probabilistic assumptions. The present paper reviews the cases of bi-tonic behavior for the correction factor, concentrating on the instance in which the question is still open. |
Year | Venue | Field |
|---|---|---|
2006 | Combinatorial and Algorithmic Foundations of Pattern and Association Discovery | Monotonic function,Discrete mathematics,Arithmetic,Probabilistic logic,Mathematics,Bounded function,Computation |
DocType | Citations | PageRank |
Conference | 1 | 0.41 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alberto Apostolico | 1 | 1441 | 182.20 |
| Cinzia Pizzi | 2 | 139 | 15.73 |