Motif Extraction from Weighted Sequences

Costas S. Iliopoulos, Katerina Perdikuri, E. Theodoridis, A. Tsakalidis, K. Tsichlas

Research output: Chapter in Book/Report/Conference proceedingConference paper

10 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationString Processing and Information Retrieval
Subtitle of host publication11th International Conference, SPIRE 2004, Padova, Italy, October 5-8, 2004. Proceedings
EditorsAlberto Apostolico, Massimo Melucci
Place of PublicationBerlin and New York
PublisherSpringer Berlin Heidelberg
Pages286-297
Number of pages12
VolumeN/A
EditionN/A
ISBN (Print)3540232109
DOIs
Publication statusPublished - 2004
Event11th International Conference on String Processing and Information Retrieval (SPIRE) - Padova, Italy
Duration: 1 Jan 2004 → …

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume3246
ISSN (Print)0302-9743

Conference

Conference11th International Conference on String Processing and Information Retrieval (SPIRE)
Country/TerritoryItaly
CityPadova
Period1/01/2004 → …

Fingerprint

Dive into the research topics of 'Motif Extraction from Weighted Sequences'. Together they form a unique fingerprint.

Cite this