Finding approximate repetitions under hamming distance

Roman Kolpakov, Gregory Kucherov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

25 Citations (Scopus)

Abstract

The problem of computing tandem repetitions with K possible mismatches is studied. Two main definitions are considered, and for both of them an O(nK logK + S) algorithm is proposed (S the size of the output). This improves, in particular, the bound obtained in [17].

Original languageEnglish
Title of host publicationAlgorithms - ESA 2001 - 9th Annual European Symposium, Proceedings
EditorsFriedhelm Meyer auf der Heide
PublisherSpringer Verlag
Pages170-181
Number of pages12
ISBN (Print)9783540424932
DOIs
Publication statusPublished - 2001
Externally publishedYes
Event9th Annual European Symposium on Algorithms, ESA 2001 - Arhus, Denmark
Duration: 28 Aug 200131 Aug 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2161
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th Annual European Symposium on Algorithms, ESA 2001
Country/TerritoryDenmark
CityArhus
Period28/08/0131/08/01

Fingerprint

Dive into the research topics of 'Finding approximate repetitions under hamming distance'. Together they form a unique fingerprint.

Cite this