𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An optimal algorithm to compute all the covers of a string

✍ Scribed by Dennis Moore; W.F. Smyth

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
667 KB
Volume
50
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Fast Algorithm for the Optimal Alignme
A Fast Algorithm for the Optimal Alignment of Three Strings
✍ Lloyd Allison πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 272 KB

LLOYD ALLISON Department of Computer Science, Monash University, Australia 3168 (Received on 15 December 1992, Accepted in revised form on 10 March 1993) Ukkonen's (pair-wise) string alignment technique is extended to the problem of finding an optimal alignment for three strings. The resulting alg

An Algorithm To Compute The Invariant Ri
An Algorithm To Compute The Invariant Ring Of A Ga-action On An Affine Variety
✍ Arno van den Essen πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 159 KB

We describe an algorithm which computes the invariants of all \(G_{a}\)-actions on affine varieties, in case the invariant ring is finitely generated. The algorithm is based on a study of the kernel of a locally nilpotent derivation and some algoritlums from the theory of GrΓΆbner bases.