### Abstract

Lingua originale | English |
---|---|

pagine (da-a) | 152-166 |

Numero di pagine | 15 |

Rivista | Theoretical Computer Science |

Volume | 385 |

Stato di pubblicazione | Published - 2007 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cita questo

*Theoretical Computer Science*,

*385*, 152-166.

**Languages with mismatches.** / Restivo, Antonio; Mignosi, Filippo; Sciortino, Marinella; Gabriele, Alessandra; Epifanio, Chiara; Mignosi, Filippo.

Risultato della ricerca: Article

*Theoretical Computer Science*, vol. 385, pagg. 152-166.

}

TY - JOUR

T1 - Languages with mismatches

AU - Restivo, Antonio

AU - Mignosi, Filippo

AU - Sciortino, Marinella

AU - Gabriele, Alessandra

AU - Epifanio, Chiara

AU - Mignosi, Filippo

PY - 2007

Y1 - 2007

N2 - In this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S and the maximal length of the minimal forbidden words of the language of factors of S with errors. Moreover, the repetition index plays an important role in the construction of an indexing data structure. More precisely, given a text S over a fixed alphabet, we build a data structure for approximate string matching having average size O(|S|⋅logk+1|S|) and answering queries in time O(|x|+|occ(x)|) for any word x, where occ is the list of all occurrences of x in S up to errors.

AB - In this paper we study some combinatorial properties of a class of languages that represent sets of words occurring in a text S up to some errors. More precisely, we consider sets of words that occur in a text S with k mismatches in any window of size r. The study of this class of languages mainly focuses both on a parameter, called repetition index, and on the set of the minimal forbidden words of the language of factors of S with errors. The repetition index of a string S is defined as the smallest integer such that all strings of this length occur at most in a unique position of the text S up to errors. We prove that there is a strong relation between the repetition index of S and the maximal length of the minimal forbidden words of the language of factors of S with errors. Moreover, the repetition index plays an important role in the construction of an indexing data structure. More precisely, given a text S over a fixed alphabet, we build a data structure for approximate string matching having average size O(|S|⋅logk+1|S|) and answering queries in time O(|x|+|occ(x)|) for any word x, where occ is the list of all occurrences of x in S up to errors.

UR - http://hdl.handle.net/10447/29642

M3 - Article

VL - 385

SP - 152

EP - 166

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -