Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with strings
Search options not deleted
user 64824
Questions about sequences of symbols, sets thereof and their properties as well as uses.
0
votes
0
answers
92
views
Lexicographically minimal string rotation
In this page: https://en.wikipedia.org/wiki/Lexicographically_minimal_string_rotation there is the Booth's Algorithm for lexicographically minimal string rotation but there is no proof. I can't access …
- 345
5
votes
1
answer
118
views
Primitive word and cyclic rotations
Definition. A word $w \in \Sigma^*$ is primitive if $w=u^n \rightarrow n=1$.
Is it true that a word is primitive if and only if its all cyclic rotations are dstinct?
- 345
0
votes
0
answers
94
views
Inverse of Burrows-Wheeler
We can invert the Burrows-Wheeler with this method:
The inverse can be understood this way. Take the final table in the
BWT algorithm, and erase all but the last column. Given only this
inform …
- 345
0
votes
1
answer
171
views
Non consant size alphabet
Sometimes I read that an algorithm works on constant size alphabet and it is clear for me but what means that an algorithm works with a non constant size alphabet? I would like to see an example.
- 345