Mhaskar, Neerja; Smyth, W. F. String covering: a survey. (English) Zbl 07798898 Fundam. Inform. 190, No. 1, 17-45 (2022). MSC: 68-XX PDFBibTeX XMLCite \textit{N. Mhaskar} and \textit{W. F. Smyth}, Fundam. Inform. 190, No. 1, 17--45 (2022; Zbl 07798898) Full Text: DOI arXiv
Alzamel, Mai; Ayad, Lorraine A. K.; Bernardini, Giulia; Grossi, Roberto; Iliopoulos, Costas S.; Pisanti, Nadia; Pissis, Solon P.; Rosone, Giovanna Comparing degenerate strings. (English) Zbl 1497.68587 Fundam. Inform. 175, No. 1-4, 41-58 (2020). MSC: 68W32 68W40 PDFBibTeX XMLCite \textit{M. Alzamel} et al., Fundam. Inform. 175, No. 1--4, 41--58 (2020; Zbl 1497.68587) Full Text: DOI
Karampelas, Andreas; Vouros, George A. Time and space efficient large scale link discovery using string similarities. (English) Zbl 1464.68326 Fundam. Inform. 172, No. 3, 299-325 (2020). MSC: 68T10 68M11 68W32 PDFBibTeX XMLCite \textit{A. Karampelas} and \textit{G. A. Vouros}, Fundam. Inform. 172, No. 3, 299--325 (2020; Zbl 1464.68326) Full Text: DOI
Castiglione, Giuseppa; Mantaci, Sabrina; Restivo, Antonio Some investigations on similarity measures based on absent words. (English) Zbl 1435.68248 Fundam. Inform. 171, No. 1-4, 97-112 (2020). MSC: 68R15 68W32 PDFBibTeX XMLCite \textit{G. Castiglione} et al., Fundam. Inform. 171, No. 1--4, 97--112 (2020; Zbl 1435.68248) Full Text: DOI
Chairungsee, Supaporn Efficient approaches to compute longest previous non-overlapping factor array. (English) Zbl 1403.68370 Fundam. Inform. 163, No. 3, 291-304 (2018). MSC: 68W32 68P30 PDFBibTeX XMLCite \textit{S. Chairungsee}, Fundam. Inform. 163, No. 3, 291--304 (2018; Zbl 1403.68370) Full Text: DOI
Mhaskar, Neerja; Smyth, W. F. Frequency covers for strings. (English) Zbl 1423.68622 Fundam. Inform. 163, No. 3, 275-289 (2018). MSC: 68W32 68P05 PDFBibTeX XMLCite \textit{N. Mhaskar} and \textit{W. F. Smyth}, Fundam. Inform. 163, No. 3, 275--289 (2018; Zbl 1423.68622) Full Text: DOI
Hooshmand, Sahar; Tavakoli, Neda; Abedin, Paniz; Thankachan, Sharma V. On computing average common substring over run length encoded sequences. (English) Zbl 1403.68373 Fundam. Inform. 163, No. 3, 267-273 (2018). MSC: 68W32 68P30 68W40 PDFBibTeX XMLCite \textit{S. Hooshmand} et al., Fundam. Inform. 163, No. 3, 267--273 (2018; Zbl 1403.68373) Full Text: DOI arXiv
Alzamel, Mai; Gao, Jia; Iliopoulos, Costas S.; Liu, Chang Efficient computation of palindromes in sequences with uncertainties. (English) Zbl 1403.68366 Fundam. Inform. 163, No. 3, 253-266 (2018). MSC: 68W32 68W40 PDFBibTeX XMLCite \textit{M. Alzamel} et al., Fundam. Inform. 163, No. 3, 253--266 (2018; Zbl 1403.68366) Full Text: DOI
Ganguly, Arnab; Patil, Manish; Shah, Rahul; Thankachan, Sharma V. A linear space data structure for range LCP queries. (English) Zbl 1405.68463 Fundam. Inform. 163, No. 3, 245-251 (2018). MSC: 68W32 68P05 PDFBibTeX XMLCite \textit{A. Ganguly} et al., Fundam. Inform. 163, No. 3, 245--251 (2018; Zbl 1405.68463) Full Text: DOI
Grabowski, Szymon; Kociumaka, Tomasz; Radoszewski, Jakub On abelian longest common factor with and without RLE. (English) Zbl 1452.68280 Fundam. Inform. 163, No. 3, 225-244 (2018). MSC: 68W32 PDFBibTeX XMLCite \textit{S. Grabowski} et al., Fundam. Inform. 163, No. 3, 225--244 (2018; Zbl 1452.68280) Full Text: DOI arXiv
Charalampopoulos, Panagiotis (ed.); Crochemore, Maxime (ed.); Pissis, Solon P. (ed.) Preface: Foundations of bioinformatics. (English) Zbl 1435.68021 Fundam. Inform. 163, No. 3, i (2018). MSC: 68-06 68W32 00B25 PDFBibTeX XMLCite \textit{P. Charalampopoulos} (ed.) et al., Fundam. Inform. 163, No. 3, i (2018; Zbl 1435.68021) Full Text: DOI
Duchi, Enrica; Guerrini, Veronica; Rinaldi, Simone A generating tree for permutations avoiding the pattern \(122^+3\). (English) Zbl 1397.68240 Fundam. Inform. 163, No. 1, 21-39 (2018). MSC: 68W32 05A05 PDFBibTeX XMLCite \textit{E. Duchi} et al., Fundam. Inform. 163, No. 1, 21--39 (2018; Zbl 1397.68240) Full Text: DOI
Mantaci, Sabrina; Restivo, Antonio; Rosone, Giovanna; Russo, Floriana; Sciortino, Marinella On fixed points of the Burrows-Wheeler transform. (English) Zbl 1390.68784 Fundam. Inform. 154, No. 1-4, 277-288 (2017). Reviewer: Irina Ioana Mohorianu (Oxford) MSC: 68W32 68P30 PDFBibTeX XMLCite \textit{S. Mantaci} et al., Fundam. Inform. 154, No. 1--4, 277--288 (2017; Zbl 1390.68784) Full Text: DOI
Alatabbi, Ali; Daykin, Jacqueline W.; Rahman, M. Sohel; Smyth, William F. Simple linear comparison of strings in \(V\)-order. (English) Zbl 1335.68303 Fundam. Inform. 139, No. 2, 115-126 (2015). MSC: 68W32 PDFBibTeX XMLCite \textit{A. Alatabbi} et al., Fundam. Inform. 139, No. 2, 115--126 (2015; Zbl 1335.68303) Full Text: DOI
Bergstra, J. A.; Middelburg, C. A. On algorithmic equivalence of instruction sequences for computing bit string functions. (English) Zbl 1334.68313 Fundam. Inform. 138, No. 4, 411-434 (2015). MSC: 68W32 PDFBibTeX XMLCite \textit{J. A. Bergstra} and \textit{C. A. Middelburg}, Fundam. Inform. 138, No. 4, 411--434 (2015; Zbl 1334.68313) Full Text: DOI arXiv
Egidi, Lavinia; Manzini, Giovanni Spaced seed design using perfect rulers. (English) Zbl 1286.68525 Fundam. Inform. 131, No. 2, 187-203 (2014). MSC: 68W32 PDFBibTeX XMLCite \textit{L. Egidi} and \textit{G. Manzini}, Fundam. Inform. 131, No. 2, 187--203 (2014; Zbl 1286.68525) Full Text: DOI
Chowdhury, Shihabur Rahman; Hasan, Md. Mahbubul; Iqbal, Sumaiya; Rahman, M. Sohel Computing a longest common palindromic subsequence. (English) Zbl 1310.68267 Fundam. Inform. 129, No. 4, 329-340 (2014). MSC: 68W32 68R15 90C39 PDFBibTeX XMLCite \textit{S. R. Chowdhury} et al., Fundam. Inform. 129, No. 4, 329--340 (2014; Zbl 1310.68267) Full Text: DOI
Ilie, Lucian; Smyth, William F. Minimum unique substrings and maximum repeats. (English) Zbl 1252.68360 Fundam. Inform. 110, No. 1-4, 183-195 (2011). Reviewer: Meng Zhang (Changchun) MSC: 68W32 PDFBibTeX XMLCite \textit{L. Ilie} and \textit{W. F. Smyth}, Fundam. Inform. 110, No. 1--4, 183--195 (2011; Zbl 1252.68360) Full Text: DOI
Crochemore, Maxime; Kubica, Marcin; Waleń, Tomasz; Iliopoulos, Costas S.; Rahman, M. Sohel Finding patterns in given intervals. (English) Zbl 1216.68353 Fundam. Inform. 101, No. 3, 173-186 (2010). MSC: 68W32 68P05 68P10 PDFBibTeX XMLCite \textit{M. Crochemore} et al., Fundam. Inform. 101, No. 3, 173--186 (2010; Zbl 1216.68353) Full Text: DOI
Deorowicz, Sebastian Bit-parallel algorithm for the constrained longest common subsequence problem. (English) Zbl 1204.68279 Fundam. Inform. 99, No. 4, 409-433 (2010). MSC: 68W32 90C39 PDFBibTeX XMLCite \textit{S. Deorowicz}, Fundam. Inform. 99, No. 4, 409--433 (2010; Zbl 1204.68279) Full Text: DOI
Allali, Julien; Ferraro, Pascal; Hanna, Pierre; Iliopoulos, Costas; Robine, Matthias Toward a general framework for polyphonic comparison. (English) Zbl 1198.68135 Fundam. Inform. 97, No. 3, 331-346 (2009). MSC: 68P20 00A65 68W32 PDFBibTeX XMLCite \textit{J. Allali} et al., Fundam. Inform. 97, No. 3, 331--346 (2009; Zbl 1198.68135) Full Text: DOI
Iliopoulos, Costas S.; Smyth, W. F.; Yusufu, Munina Faster algorithms for computing maximal multirepeats in multiple sequences. (English) Zbl 1189.68180 Fundam. Inform. 97, No. 3, 311-320 (2009). MSC: 68W32 PDFBibTeX XMLCite \textit{C. S. Iliopoulos} et al., Fundam. Inform. 97, No. 3, 311--320 (2009; Zbl 1189.68180) Full Text: DOI
Bloom, Stephen L.; Ésik, Zoltán Deciding whether the frontier of a regular tree is scattered. (English) Zbl 1066.68060 Fundam. Inform. 55, No. 1, 1-21 (2003). MSC: 68Q45 PDFBibTeX XMLCite \textit{S. L. Bloom} and \textit{Z. Ésik}, Fundam. Inform. 55, No. 1, 1--21 (2003; Zbl 1066.68060)