- FindStat

Identifier

Mp00261: Binary words —Burrows-Wheeler⟶ Binary words
Mp00104: Binary words —reverse⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words

Images

0 => 0 => 0 => 1

1 => 1 => 1 => 0

00 => 00 => 00 => 11

01 => 10 => 01 => 10

10 => 10 => 01 => 10

11 => 11 => 11 => 00

000 => 000 => 000 => 111

001 => 100 => 001 => 110

010 => 100 => 001 => 110

011 => 110 => 011 => 100

100 => 100 => 001 => 110

101 => 110 => 011 => 100

110 => 110 => 011 => 100

111 => 111 => 111 => 000

0000 => 0000 => 0000 => 1111

0001 => 1000 => 0001 => 1110

0010 => 1000 => 0001 => 1110

0011 => 1010 => 0101 => 1010

0100 => 1000 => 0001 => 1110

0101 => 1100 => 0011 => 1100

0110 => 1010 => 0101 => 1010

0111 => 1110 => 0111 => 1000

1000 => 1000 => 0001 => 1110

1001 => 1010 => 0101 => 1010

1010 => 1100 => 0011 => 1100

1011 => 1110 => 0111 => 1000

1100 => 1010 => 0101 => 1010

1101 => 1110 => 0111 => 1000

1110 => 1110 => 0111 => 1000

1111 => 1111 => 1111 => 0000

00000 => 00000 => 00000 => 11111

00001 => 10000 => 00001 => 11110

00010 => 10000 => 00001 => 11110

00011 => 10010 => 01001 => 10110

00100 => 10000 => 00001 => 11110

00101 => 11000 => 00011 => 11100

00110 => 10010 => 01001 => 10110

00111 => 10110 => 01101 => 10010

01000 => 10000 => 00001 => 11110

01001 => 11000 => 00011 => 11100

01010 => 11000 => 00011 => 11100

01011 => 11100 => 00111 => 11000

01100 => 10010 => 01001 => 10110

01101 => 11100 => 00111 => 11000

01110 => 10110 => 01101 => 10010

01111 => 11110 => 01111 => 10000

10000 => 10000 => 00001 => 11110

10001 => 10010 => 01001 => 10110

10010 => 11000 => 00011 => 11100

10011 => 10110 => 01101 => 10010

10100 => 11000 => 00011 => 11100

10101 => 11100 => 00111 => 11000

10110 => 11100 => 00111 => 11000

10111 => 11110 => 01111 => 10000

11000 => 10010 => 01001 => 10110

11001 => 10110 => 01101 => 10010

11010 => 11100 => 00111 => 11000

11011 => 11110 => 01111 => 10000

11100 => 10110 => 01101 => 10010

11101 => 11110 => 01111 => 10000

11110 => 11110 => 01111 => 10000

11111 => 11111 => 11111 => 00000

000000 => 000000 => 000000 => 111111

000001 => 100000 => 000001 => 111110

000010 => 100000 => 000001 => 111110

000011 => 100010 => 010001 => 101110

000100 => 100000 => 000001 => 111110

000101 => 101000 => 000101 => 111010

000110 => 100010 => 010001 => 101110

000111 => 100110 => 011001 => 100110

001000 => 100000 => 000001 => 111110

001001 => 110000 => 000011 => 111100

001010 => 101000 => 000101 => 111010

001011 => 101100 => 001101 => 110010

001100 => 100010 => 010001 => 101110

001101 => 110010 => 010011 => 101100

001110 => 100110 => 011001 => 100110

001111 => 101110 => 011101 => 100010

010000 => 100000 => 000001 => 111110

010001 => 101000 => 000101 => 111010

010010 => 110000 => 000011 => 111100

010011 => 110010 => 010011 => 101100

010100 => 101000 => 000101 => 111010

010101 => 111000 => 000111 => 111000

010110 => 101100 => 001101 => 110010

010111 => 111010 => 010111 => 101000

011000 => 100010 => 010001 => 101110

011001 => 101100 => 001101 => 110010

011010 => 110010 => 010011 => 101100

011011 => 111100 => 001111 => 110000

011100 => 100110 => 011001 => 100110

011101 => 111010 => 010111 => 101000

011110 => 101110 => 011101 => 100010

011111 => 111110 => 011111 => 100000

100000 => 100000 => 000001 => 111110

100001 => 100010 => 010001 => 101110

100010 => 101000 => 000101 => 111010

100011 => 100110 => 011001 => 100110

100100 => 110000 => 000011 => 111100

100101 => 101100 => 001101 => 110010

100110 => 110010 => 010011 => 101100

>>> Load all 1565 entries. <<<

Map

Burrows-Wheeler

Description

The Burrows-Wheeler transform of a binary word.
The Burrows-Wheeler transform of a finite word $w$ is obtained from $w$ by first listing the conjugates of $w$ in lexicographic order and then concatenating the final letters of the conjugates in this order.

Map

reverse

Description

Return the reversal of a binary word.

Map

complement

Description

Send a binary word to the word obtained by interchanging the two letters.