@inbook{42b870cb3b6b4ca29ee4b67d78d95543,
title = "Motif Extraction from Weighted Sequences",
abstract = "We present in this paper three algorithms. The first extracts repeated motifs from a weighted sequence. The motifs correspond to words which occur at least q times and with hamming distance a in a weighted sequence with probability greater than or equal to 1/k each time, where k is a small constant. The second algorithm extracts common motifs from a set of N greater than or equal to 2 weighted sequences with hamming distance e. In the second case, the motifs must occur twice with probability greater than or equal to 1/k, in 1 less than or equal to q less than or equal to N distinct sequences of the set. The third algorithm extracts maximal pairs from a weighted sequence. A pair in a sequence is the occurrence of the same substring twice. In addition, the algorithms presented in this paper improve slightly on previous work on these problems.",
author = "Iliopoulos, {Costas S.} and Katerina Perdikuri and E. Theodoridis and A. Tsakalidis and K. Tsichlas",
year = "2004",
doi = "10.1007/978-3-540-30213-1_41",
language = "English",
isbn = "3540232109",
volume = "N/A",
series = "Lecture Notes in Computer Science",
publisher = "Springer Berlin Heidelberg",
pages = "286--297",
editor = "Alberto Apostolico and Massimo Melucci",
booktitle = "String Processing and Information Retrieval",
edition = "N/A",
note = "11th International Conference on String Processing and Information Retrieval (SPIRE) ; Conference date: 01-01-2004",
}