Extended suffix array construction using Lyndon factors

[1]  Antonio Restivo,et al.  Suffix array and Lyndon factorization of a text , 2014, J. Discrete Algorithms.

[2]  Jorma Tarhio,et al.  Alternative Algorithms for Lyndon Factorization , 2014, Stringology.

[3]  Antonio Restivo,et al.  Suffixes, Conjugates and Lyndon Words , 2013, Developments in Language Theory.

[4]  Antonio Restivo,et al.  Sorting Suffixes of a Text via its Lyndon Factorization , 2013, Stringology.

[5]  Bernard De Baets,et al.  essaMEM: finding maximal exact matches using enhanced sparse suffix arrays , 2013, Bioinform..

[6]  S. Kurtz,et al.  Readjoiner: a fast and memory efficient string graph-based sequence assembler , 2012, BMC Bioinformatics.

[7]  Zsuzsanna Lipták,et al.  KABOOM! A new suffix array based algorithm for clustering expression data , 2011, Bioinform..

[8]  Gonzalo Navarro,et al.  Practical Compressed Suffix Trees , 2010, SEA.

[9]  Jacques-Olivier Lachaud,et al.  Lyndon + Christoffel = digitally convex , 2009, Pattern Recognit..

[10]  Travis Gagie,et al.  Lightweight Data Indexing and Compression in External Memory , 2009, Algorithmica.

[11]  B. Schmidt,et al.  SHREC: a short-read error correction method , 2009, Bioinform..

[12]  Juha Kärkkäinen,et al.  Permuted Longest-Common-Prefix Array , 2009, CPM.

[13]  Ge Nong,et al.  Linear Suffix Array Construction by Almost Pure Induced-Sorting , 2009, 2009 Data Compression Conference.

[14]  Gonzalo Navarro,et al.  An(other) Entropy-Bounded Compressed Suffix Tree , 2008, CPM.

[15]  Alistair Moffat,et al.  Improving suffix array locality for fast pattern matching on disk , 2008, SIGMOD Conference.

[16]  Rodrigo González,et al.  Improved Dynamic Rank-Select Entropy-Bound Structures , 2008, LATIN.

[17]  Michal Zemlicka,et al.  Suffix Array for Large Alphabet , 2008, Data Compression Conference (dcc 2008).

[18]  Jan Holub,et al.  DCA Using Suffix Arrays , 2008, Data Compression Conference (dcc 2008).

[19]  Kunihiko Sadakane,et al.  Compressed Suffix Trees with Full Functionality , 2007, Theory of Computing Systems.

[20]  Wolfgang Gerlach,et al.  Engineering a compressed suffix tree implementation , 2007, JEAL.

[21]  Peter Sanders,et al.  Linear work suffix array construction , 2006, JACM.

[22]  Gonzalo Navarro,et al.  Dynamic entropy-compressed sequences and full-text indexes , 2006, TALG.

[23]  Gonzalo Navarro,et al.  Succinct Suffix Arrays based on Run-Length Encoding , 2005, Nord. J. Comput..

[24]  Christophe Reutenauer,et al.  Lyndon words, permutations and trees , 2003, Theor. Comput. Sci..

[25]  Siu-Ming Yiu,et al.  A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays , 2002, Algorithmica.

[26]  Hiroki Arimura,et al.  Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications , 2001, CPM.

[27]  Kunihiko Sadakane,et al.  Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array , 2000, ISAAC.

[28]  Giovanni Manzini,et al.  Opportunistic data structures with applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[29]  Roberto Grossi,et al.  Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) , 2000, STOC '00.

[30]  Michael A. Bender,et al.  The LCA Problem Revisited , 2000, LATIN.

[31]  Roberto Grossi,et al.  The string B-tree: a new data structure for string search in external memory and its applications , 1999, JACM.

[32]  Dan Gusfield,et al.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[33]  Maxime Crochemore,et al.  Fast parallel Lyndon factorization with applications , 1995, Mathematical systems theory.

[34]  Eugene W. Myers,et al.  Suffix arrays: a new method for on-line string searches , 1993, SODA '90.

[35]  Jean Pierre Duval,et al.  Factorizing Words over an Ordered Alphabet , 1983, J. Algorithms.

[36]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[37]  R. Lyndon,et al.  Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series , 1958 .

[38]  Meng He,et al.  Indexing Compressed Text , 2003 .

[39]  John Riedl,et al.  Generalized suffix trees for biological sequence data: applications and implementation , 1994, 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences.

[40]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .