### Abstract

Original language | English |
---|---|

Journal | Theoretical Computer Science |

Volume | 410 (2009) |

Pages (from-to) | 2999-3005 |

Number of pages | 7 |

ISSN | 0304-3975 |

DOIs | |

Publication status | Published - 2009 |

MoE publication type | A1 Journal article-refereed |

### Fields of Science

- 113 Computer and information sciences

### Cite this

*Theoretical Computer Science*,

*410 (2009)*, 2999-3005. https://doi.org/10.1016/j.tcs.2009.03.013

}

*Theoretical Computer Science*, vol. 410 (2009), pp. 2999-3005. https://doi.org/10.1016/j.tcs.2009.03.013

**Efficient construction of maximal and minimal representations of motifs of a string.** / Nicolas, Francois; Mäkinen, Veli; Ukkonen, Esko.

Research output: Contribution to journal › Article › Scientific › peer-review

TY - JOUR

T1 - Efficient construction of maximal and minimal representations of motifs of a string

AU - Nicolas, Francois

AU - Mäkinen, Veli

AU - Ukkonen, Esko

PY - 2009

Y1 - 2009

N2 - "Two substrings of a given text string are called synchronous (occurrence-equivalent) if their sets of occurrence locations are translates of each other. Linear time algorithms are given for the problems of finding a shortest and a longest substring that is synchronous with a given substring. We also introduce approximate variants of the motif discovery problem and give polynomial time algorithms for finding longest and shortest substrings whose suitably translated occurrence location set contains or, respectively, is contained in a given set of locations. The FFT technique used here also leads to an O(n log n) algorithm for finding the maximum-content gapped motif that is synchronous with a given set of locations; the previously known algorithm for this problem is only quadratic. (C) 2009 Elsevier B.V. All rights reserved."

AB - "Two substrings of a given text string are called synchronous (occurrence-equivalent) if their sets of occurrence locations are translates of each other. Linear time algorithms are given for the problems of finding a shortest and a longest substring that is synchronous with a given substring. We also introduce approximate variants of the motif discovery problem and give polynomial time algorithms for finding longest and shortest substrings whose suitably translated occurrence location set contains or, respectively, is contained in a given set of locations. The FFT technique used here also leads to an O(n log n) algorithm for finding the maximum-content gapped motif that is synchronous with a given set of locations; the previously known algorithm for this problem is only quadratic. (C) 2009 Elsevier B.V. All rights reserved."

KW - 113 Computer and information sciences

U2 - 10.1016/j.tcs.2009.03.013

DO - 10.1016/j.tcs.2009.03.013

M3 - Article

VL - 410 (2009)

SP - 2999

EP - 3005

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -