Faster algorithms for computing maximal multirepeats in multiple sequences
A repeat in a string is a substring that occurs more than once. A repeat is extendible if every occurrence of the repeat has an identical letter either on the left or on the right; otherwise, it is maximal. A multirepeat is a repeat that occurs at least mmin times (mmin greater than/equal to 2) in e...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
IOS Press
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/22370 |