## 3 Non-Overlapping LZSS
### Complexity Bounds
[CrossRef]
* (13) [PERSON]; [PERSON]; [PERSON] Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time. In Proceedings of the SODA, Barcelona, Spain, 16-19 January 2017; pp. 408-424. * (14) [PERSON]; [PERSON] Fully Functional Static and Dynamic Succinct Trees. _ACM Trans. Algorithms_**2014**, _10_, 16:1-16:39. * (15) [PERSON]; [PERSON] Comparison of LZ77-type parsings. _Inf. Process. Lett._**2019**, _141_, 25-29. [CrossRef]
* (16) [PERSON] [PERSON]; [PERSON] [PERSON] Finding approximate repetitions under Hamming distance. _Theor. Comput. Sci._**2003**, _303_, 135-156. [CrossRef]
* (17) [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON]; [PERSON] [PERSON] Linear-time computation of local periods. _Theor. Comput. Sci._**2004**, _326_, 229-240. [CrossRef]
* (18) [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] A linear time algorithm for seeds computation. In Proceedings of the SODA, Kyoto, Japan, 17-19 January 2012; pp. 1095-1112. * (19) [PERSON]; [PERSON] [PERSON] A Linear Time Algorithm for Finding Tandem Repeat in DNA Sequences. In Proceedings of the ICIT, Melbourne, Australia, 13-15 February 2019; pp. 426-429. * (20) [PERSON] _Applied Combinatorics on Words_; Encyclopedia of Mathematics and Its Applications, Cambridge University Press: Cambridge, UK, 2005. * (21) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Efficient algorithms for three variants of the LPF table. _J. Discret. Algorithms_**2012**, _11_, 51-61. [CrossRef]
* (22) [PERSON]; [PERSON]; [PERSON]; [PERSON] Longest Previous Non-overlapping Factors Computation. In Proceedings of the DEXA, Valencia, Spain, 1-4 September 2015; pp. 5-8. * (23) [PERSON]; [PERSON] Longest Previous Non-overlapping Factors Table Computation. In Proceedings of the COCOA, LNCS, Shanghai, China, 16-18 December 2017; Volume 10628, pp. 483-491. * (24) [PERSON] Efficient Approaches to Compute Longest Previous Non-overlapping Factor Array. _Fundam. Inform._**2018**, _163_, 291-304. [CrossRef]
* (25) [PERSON]; [PERSON] On the Computation of Longest Previous Non-overlapping Factors. In Proceedings of the SPIRE, LNCS, Segovia, Spain, 7-9 October 2019; Volume 11811, pp. 372-381. * (26) [PERSON]; [PERSON] Computing Longest Previous Factor in linear time and applications. _Inf. Process. Lett._**2008**, _106_, 75-80. [CrossRef]* _[PERSON] et al. (2017)_ [PERSON]; [PERSON]; [PERSON] Computing All Distinct Squares in Linear Time for Integer Alphabets. In Proceedings of the CPM, LIPIcs, Copenhagen, Denmark, 17-19 June 2017; Volume 78, pp. 22:1-22:18. * _[PERSON] and [PERSON] (2000)_ [PERSON]; [PERSON] [PERSON] Opportunistic Data Structures with Applications. In Proceedings of the FOCS, Redondo Beach, CA, USA, 12-14 November 2000; pp. 390-398. * [PERSON] and [PERSON] (2008) [PERSON]; [PERSON] [PERSON] An Online Algorithm for Finding the Longest Previous Factors. In Proceedings of the ESA, LNCS, Karlsruhe, Germany, 15-17 September 2008; Volume 5193, pp. 696-707. * _[PERSON] and [PERSON] (2020)_ [PERSON]; [PERSON] [PERSON] Faster Online Computation of the Succinct Longest Previous Factor Array. In Proceedings of the CiE, LNCS, Fisciano, Italy, 29 June-3 July 2020; Volume 12098, pp. 339-352. * _[PERSON] (1997)_ [PERSON] _Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology_; Cambridge University Press: Cambridge, UK, 1997. * [PERSON] and [PERSON] (2011) [PERSON]; [PERSON] [PERSON] Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. _SIAM J. Comput._**2011**, _40_, 465-492. [CrossRef]
* [PERSON] et al. (2009) [PERSON]; [PERSON]; [PERSON] Faster entropy-bounded compressed suffix trees. _Theor. Comput. Sci._**2009**, _410_, 5354-5364. [CrossRef]
* [PERSON] et al. (2014) [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] Generalized substring compression. _Theor. Comput. Sci._**2014**, _525_, 42-54. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON] Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP.