Arnold, Michael; Ohlebusch, Enno Linear time algorithms for generalizations of the longest common substring problem. (English) Zbl 1219.68126 Algorithmica 60, No. 4, 806-818 (2011). MSC: 68R15 68W32 PDFBibTeX XMLCite \textit{M. Arnold} and \textit{E. Ohlebusch}, Algorithmica 60, No. 4, 806--818 (2011; Zbl 1219.68126) Full Text: DOI
Iliopoulos, Costas S.; Rahman, M. Sohel Indexing factors with gaps. (English) Zbl 1180.68127 Algorithmica 55, No. 1, 60-70 (2009). MSC: 68P05 68W32 PDFBibTeX XMLCite \textit{C. S. Iliopoulos} and \textit{M. S. Rahman}, Algorithmica 55, No. 1, 60--70 (2009; Zbl 1180.68127) Full Text: DOI
Amir, Amihood; Butman, Ayelet; Lewenstein, Moshe; Porat, Ely Real two dimensional scaled matching. (English) Zbl 1188.68119 Algorithmica 53, No. 3, 314-336 (2009). MSC: 68P10 68T10 68R15 68U10 PDFBibTeX XMLCite \textit{A. Amir} et al., Algorithmica 53, No. 3, 314--336 (2009; Zbl 1188.68119) Full Text: DOI
Kim, Dong Kyue; Kim, Minhwan; Park, Heejin Linearized suffix tree: An efficient index data structure with the capabilities of suffix trees and suffix arrays. (English) Zbl 1163.68013 Algorithmica 52, No. 3, 350-377 (2008). MSC: 68P05 PDFBibTeX XMLCite \textit{D. K. Kim} et al., Algorithmica 52, No. 3, 350--377 (2008; Zbl 1163.68013) Full Text: DOI