Name
Abstract | ||
|---|---|---|
A Lyndon word is a primitive string which is lexicographically smallest among cyclic permutations of its characters. Lyndon words are used for constructing bases in free algebras, constructing de Bruijn sequences, finding the lexicographically smallest or largest substring in a string, and succinct suffix-prefix matching of highly periodic strings. In this paper, we extend the concept of the Lyndon word to two dimensions. We introduce the 2D Lyndon word and use it to capture 2D horizontal periodicity of a matrix in which each row is highly periodic, and to efficiently solve 2D horizontal suffix-prefix matching among a set of patterns. This yields a succinct and efficient algorithm for 2D dictionary matching. We present several algorithms that compute the 2D Lyndon word that represents a matrix. The final algorithm achieves linear time complexity even when the least common multiple of the periods of the rows is exponential in the matrix width. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-02432-5_24 | SPIRE |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Substring,Matrix (mathematics),Permutation,Least common multiple,De Bruijn sequence,Lexicographical order,Lyndon word,Time complexity,Mathematics | Conference | 8214 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
13 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shoshana Marcus | 1 | 20 | 3.54 |
| Dina Sokol | 2 | 144 | 12.84 |