Counting Irreducible Double Occurrence Words

Details Counting Irreducible Double Occurrence Words Counting Irreducible Double Occurrence Words

2011-05-15

arxiv.org/abs/1105.2926v1

Mathematics

Combinatorics

Scientific paper

A double occurrence word $w$ over a finite alphabet $\Sigma$ is a word in which each alphabet letter appears exactly twice. Such words arise naturally in the study of topology, graph theory, and combinatorics. Recently, double occurrence words have been used for studying DNA recombination events. We develop formulas for counting and enumerating several elementary classes of double occurrence words such as palindromic, irreducible, and strongly-irreducible words.

Affiliated with

Also associated with

No associations

Rating

Counting Irreducible Double Occurrence Words does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Irreducible Double Occurrence Words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Irreducible Double Occurrence Words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-241140