Words over an ordered alphabet and suffix permutations

@article{Duval2002WordsOA,
  title={Words over an ordered alphabet and suffix permutations},
  author={Jean-Pierre Duval and Arnaud Lefebvre},
  journal={RAIRO Theor. Informatics Appl.},
  year={2002},
  volume={36},
  pages={249-259}
}
Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word w , we present in this article a linear time and space method to determine whether a word w' has the same permutation on its suffixes. Using this method, we are then also able to build the class of all the words having the same permutation on their suffixes, first of all the smallest one. Finally, we note that this work can lead to a method for generating a Lyndon word randomly in… 

Inferring strings from suffix trees and links on a binary alphabet

A quick tour on suffix arrays and compressed suffix arrays

  • R. Grossi
  • Computer Science
    Theor. Comput. Sci.
  • 2011

Parameterized Suffix Arrays for Binary Strings

We consider the suffix array for parameterized binary strings that consist of only two types of parameter symbols. We show that the parameterized suffix array, as well as its longest common prefix

A suffix tree or not a suffix tree?

String Comparison in V-Order: New Lexicographic Properties & On-line Applications

New and surprising results on $V-order in strings are presented and the algorithmic consequences are explored, which show that efficient $V$-ordering of strings is a matter of considerable interest.

Counting suffix arrays and strings

Suffix array and Lyndon factorization of a text

Counting Parameterized Border Arrays for a Binary Alphabet

This paper presents a linear time algorithm to verify if a given integer array is a valid p- border array for a binary alphabet and gives an algorithm which computes all p-border arrays of length at most n, where n is a a given threshold.

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays

An algorithm which computes a solution string over an alphabet of the smallest size, in O(n) time, and the exact number of solution strings over a alphabet of size \(\sigma \).

Counting and Verifying Maximal Palindromes

The number of pal-distinct strings is described, and it is shown that they can be enumerated in time linear in the output size, for alphabets of size at most 3.

References

SHOWING 1-3 OF 3 REFERENCES

Factorizing Words over an Ordered Alphabet

A Space-Economical Suffix Tree Construction Algorithm

A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time bound as previously

Algorithmique du texte