Pattern matching with don't cares and few errors

We present solutions for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols and a bound k, our algorithms find all the places that the pattern matches the text with at most k mismatches. We first give a Θ...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer and system sciences Ročník 76; číslo 2; s. 115 - 124
Hlavní autoři: Clifford, Raphaël, Efremenko, Klim, Porat, Ely, Rothschild, Amir
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.03.2010
Témata:
Algorithms
Alignment
Errors
Group testing
Matching
Mathematical models
Pattern matching
Position (location)
Randomised algorithms
String algorithms
Symbols
Texts
Randomised algorithms
String algorithms
Group testing
Pattern matching
ISSN:0022-0000, 1090-2724
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present solutions for the k-mismatch pattern matching problem with don't cares. Given a text t of length n and a pattern p of length m with don't care symbols and a bound k, our algorithms find all the places that the pattern matches the text with at most k mismatches. We first give a Θ ( n ( k + log m log k ) log n ) time randomised algorithm which finds the correct answer with high probability. We then present a new deterministic Θ ( n k 2 log 2 m ) time solution that uses tools originally developed for group testing. Taking our derandomisation approach further we develop an approach based on k-selectors that runs in Θ ( n k polylog m ) time. Further, in each case the location of the mismatches at each alignment is also given at no extra cost.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2009.06.002