- FindStat

Identifier

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

Images

0 => 1 => 1 => 1

1 => 0 => 0 => 0

00 => 11 => 11 => 11

01 => 10 => 10 => 01

10 => 01 => 10 => 01

11 => 00 => 00 => 00

000 => 111 => 111 => 111

001 => 110 => 110 => 011

010 => 101 => 110 => 011

011 => 100 => 100 => 001

100 => 011 => 110 => 011

101 => 010 => 100 => 001

110 => 001 => 100 => 001

111 => 000 => 000 => 000

0000 => 1111 => 1111 => 1111

0001 => 1110 => 1110 => 0111

0010 => 1101 => 1110 => 0111

0011 => 1100 => 1010 => 0101

0100 => 1011 => 1110 => 0111

0101 => 1010 => 1100 => 0011

0110 => 1001 => 1010 => 0101

0111 => 1000 => 1000 => 0001

1000 => 0111 => 1110 => 0111

1001 => 0110 => 1010 => 0101

1010 => 0101 => 1100 => 0011

1011 => 0100 => 1000 => 0001

1100 => 0011 => 1010 => 0101

1101 => 0010 => 1000 => 0001

1110 => 0001 => 1000 => 0001

1111 => 0000 => 0000 => 0000

00000 => 11111 => 11111 => 11111

00001 => 11110 => 11110 => 01111

00010 => 11101 => 11110 => 01111

00011 => 11100 => 10110 => 01101

00100 => 11011 => 11110 => 01111

00101 => 11010 => 11100 => 00111

00110 => 11001 => 10110 => 01101

00111 => 11000 => 10010 => 01001

01000 => 10111 => 11110 => 01111

01001 => 10110 => 11100 => 00111

01010 => 10101 => 11100 => 00111

01011 => 10100 => 11000 => 00011

01100 => 10011 => 10110 => 01101

01101 => 10010 => 11000 => 00011

01110 => 10001 => 10010 => 01001

01111 => 10000 => 10000 => 00001

10000 => 01111 => 11110 => 01111

10001 => 01110 => 10110 => 01101

10010 => 01101 => 11100 => 00111

10011 => 01100 => 10010 => 01001

10100 => 01011 => 11100 => 00111

10101 => 01010 => 11000 => 00011

10110 => 01001 => 11000 => 00011

10111 => 01000 => 10000 => 00001

11000 => 00111 => 10110 => 01101

11001 => 00110 => 10010 => 01001

11010 => 00101 => 11000 => 00011

11011 => 00100 => 10000 => 00001

11100 => 00011 => 10010 => 01001

11101 => 00010 => 10000 => 00001

11110 => 00001 => 10000 => 00001

11111 => 00000 => 00000 => 00000

000000 => 111111 => 111111 => 111111

000001 => 111110 => 111110 => 011111

000010 => 111101 => 111110 => 011111

000011 => 111100 => 101110 => 011101

000100 => 111011 => 111110 => 011111

000101 => 111010 => 111010 => 010111

000110 => 111001 => 101110 => 011101

000111 => 111000 => 100110 => 011001

001000 => 110111 => 111110 => 011111

001001 => 110110 => 111100 => 001111

001010 => 110101 => 111010 => 010111

001011 => 110100 => 110010 => 010011

001100 => 110011 => 101110 => 011101

001101 => 110010 => 101100 => 001101

001110 => 110001 => 100110 => 011001

001111 => 110000 => 100010 => 010001

010000 => 101111 => 111110 => 011111

010001 => 101110 => 111010 => 010111

010010 => 101101 => 111100 => 001111

010011 => 101100 => 101100 => 001101

010100 => 101011 => 111010 => 010111

010101 => 101010 => 111000 => 000111

010110 => 101001 => 110010 => 010011

010111 => 101000 => 101000 => 000101

011000 => 100111 => 101110 => 011101

011001 => 100110 => 110010 => 010011

011010 => 100101 => 101100 => 001101

011011 => 100100 => 110000 => 000011

011100 => 100011 => 100110 => 011001

011101 => 100010 => 101000 => 000101

011110 => 100001 => 100010 => 010001

011111 => 100000 => 100000 => 000001

100000 => 011111 => 111110 => 011111

100001 => 011110 => 101110 => 011101

100010 => 011101 => 111010 => 010111

100011 => 011100 => 100110 => 011001

100100 => 011011 => 111100 => 001111

100101 => 011010 => 110010 => 010011

100110 => 011001 => 101100 => 001101

>>> Load all 1562 entries. <<<

Map

complement

Description

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

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.