Berget and Rhoades asked whether the permutation representation obtained by action of $S_{n-1}$ on parking functions length $n-1$ can be extended to a $S_{n}$. We answer this question in affirmative. realize our module two different ways. The first description involves binary Lyndon words second symmetric group lattice points trimmed standard permutahedron.

We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approaches. Hence our pattern consists of a sequence of words. From the algorithmic point of view this has several advantages: (i) the number of words is much less than the number of characters, which in effect means shorter...

Esophageal adenocarcinoma arises from Barrett’s esophagus, which is the most serious complication of gastroesophageal reflux disease. Strategies for screening involve periodic surveillance and tissue biopsies. A major challenge in such regular examinations is to record and track the disease evolution and re-localization of biopsied sites to provide targeted treatments. In this paper, we extend ...