Fast algorithms for approximate circular string matching
Background: Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optimal average-case algorithms for exact circular string matching. Approximate ci...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
Springer
2014
|
| Online Access: | http://hdl.handle.net/20.500.11937/21124 |