 |
HAL UPEC - UPEM Portal |  |
 |
Conference papers
Longest repeated motif with a block of don't cares
Abstract : We introduce an algorithm for extracting all longest repeats with k don’t cares from a given sequence. Such repeats are composed of two parts separated by a block of k don’t care symbols. The algorithm uses suffix trees to fulfill this task and relies on the ability to answer the lowest common ancestor queries in constant time. It requires O(n log n) time in the worst-case.
https://hal-upec-upem.archives-ouvertes.fr/hal-00619983
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Friday, December 18, 2015 - 9:32:47 AM
Last modification on : Saturday, January 15, 2022 - 3:57:43 AM
Long-term archiving on: : Saturday, March 19, 2016 - 11:40:40 AM
Contributor : Maxime Crochemore Connect in order to contact the contributor
Submitted on : Friday, December 18, 2015 - 9:32:47 AM
Last modification on : Saturday, January 15, 2022 - 3:57:43 AM
Long-term archiving on: : Saturday, March 19, 2016 - 11:40:40 AM
File
LATIN2004.pdf
Files produced by the author(s)