A linear partitioning algorithm for Hybrid Lyndons using-order
Authors:
- David E. DaykinDDDavid E. Daykin
- Jacqueline W. DaykinJDJacqueline W. Daykin
- W.F. SmythWSW.F. Smyth
- 1 April 2013
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 483, 149-161
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Combinatorics of Unique Maximal Factorization Families (UMFFs)Fundamenta Informaticae, 2009
- PROPERTIES AND CONSTRUCTION OF UNIQUE MAXIMAL FACTORIZATION FAMILIES FOR STRINGSInternational Journal of Foundations of Computer Science, 2008
- A note on the Burrows–Wheeler transformationTheoretical Computer Science, 2005
- STAR: an algorithm to Search for Tandem Approximate RepeatsBioinformatics, 2004
- Computation of words satisfying the “rhythmic oddity property” (after Simha Arom's works)Information Processing Letters, 2003
- Lyndon-like and V-order factorizations of stringsJournal of Discrete Algorithms, 2003
- Parallel RAM algorithms for factorizing wordsTheoretical Computer Science, 1994
- Optimal algorithms for computing the canonical form of a circular stringTheoretical Computer Science, 1992
- Factorizing words over an ordered alphabetJournal of Algorithms, 1983
- Free Differential Calculus, IV. The Quotient Groups of the Lower Central SeriesAnnals of Mathematics, 1958