King's College London

Research portal

Longest repeats with a block of k don't cares

Research output: Contribution to journalArticle

Standard

Longest repeats with a block of k don't cares. / Crochemore, Maxime; Iliopoulos, Costas S.; Mohamed, Manal; Sagot, Marie-France.

In: Journal of Theoretical Computer Science, Vol. 362, No. 1-3, 11.10.2006, p. 248-254.

Research output: Contribution to journalArticle

Harvard

Crochemore, M, Iliopoulos, CS, Mohamed, M & Sagot, M-F 2006, 'Longest repeats with a block of k don't cares', Journal of Theoretical Computer Science, vol. 362, no. 1-3, pp. 248-254. https://doi.org/10.1016/j.tcs.2006.06.029

APA

Crochemore, M., Iliopoulos, C. S., Mohamed, M., & Sagot, M-F. (2006). Longest repeats with a block of k don't cares. Journal of Theoretical Computer Science, 362(1-3), 248-254. https://doi.org/10.1016/j.tcs.2006.06.029

Vancouver

Crochemore M, Iliopoulos CS, Mohamed M, Sagot M-F. Longest repeats with a block of k don't cares. Journal of Theoretical Computer Science. 2006 Oct 11;362(1-3):248-254. https://doi.org/10.1016/j.tcs.2006.06.029

Author

Crochemore, Maxime ; Iliopoulos, Costas S. ; Mohamed, Manal ; Sagot, Marie-France. / Longest repeats with a block of k don't cares. In: Journal of Theoretical Computer Science. 2006 ; Vol. 362, No. 1-3. pp. 248-254.

Bibtex Download

@article{7353ac19934043558b96bd91eeb75289,
title = "Longest repeats with a block of k don't cares",
abstract = "We introduce an algorithm for extracting all longest repeats with k don{\textquoteright}t cares from a given sequence. Such repeats are composed of two parts separated by a block of k don{\textquoteright}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.",
author = "Maxime Crochemore and Iliopoulos, {Costas S.} and Manal Mohamed and Marie-France Sagot",
year = "2006",
month = oct,
day = "11",
doi = "10.1016/j.tcs.2006.06.029",
language = "English",
volume = "362",
pages = "248--254",
journal = "Journal of Theoretical Computer Science",
number = "1-3",

}

RIS (suitable for import to EndNote) Download

TY - JOUR

T1 - Longest repeats with a block of k don't cares

AU - Crochemore, Maxime

AU - Iliopoulos, Costas S.

AU - Mohamed, Manal

AU - Sagot, Marie-France

PY - 2006/10/11

Y1 - 2006/10/11

N2 - 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.

AB - 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.

U2 - 10.1016/j.tcs.2006.06.029

DO - 10.1016/j.tcs.2006.06.029

M3 - Article

VL - 362

SP - 248

EP - 254

JO - Journal of Theoretical Computer Science

JF - Journal of Theoretical Computer Science

IS - 1-3

ER -

View graph of relations

© 2020 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454