On weak circular squares in binary words
UNSPECIFIED (1997) On weak circular squares in binary words. In: 8th Annual Symposium on Combinatorial Pattern Matching (CPM 97), JUN 30-JUL 02, 1997, UNIV AARHUS, AARHUS, DENMARK.Full text not available from this repository.
A weak square in a binary word is a pair of adjacent nonempty blocks of the same length, having the same number of 1s. A weak circular square is a weak square which is possibly wrapped around the word: the tail protruding from the right end of the word reappears at the left end. Two weak circular squares are equivalent if they have the same length and contain the same number of ones. We prove that the longest word with only k inequivalent weak circular squares contains 4k + 2 bits and has the form (01)(2k+1) or its complement. Possible connections to tandem repeats in the human genome axe pointed out.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||COMBINATORIAL PATTERN MATCHING, PROCEEDINGS|
|Editor:||Apostolico, A and Hein, J|
|Number of Pages:||7|
|Page Range:||pp. 76-82|
|Title of Event:||8th Annual Symposium on Combinatorial Pattern Matching (CPM 97)|
|Location of Event:||UNIV AARHUS, AARHUS, DENMARK|
|Date(s) of Event:||JUN 30-JUL 02, 1997|
Actions (login required)