Amit, Mika; Crochemore, Maxime; Landau, Gad M.; Sokol, Dina Locating maximal approximate runs in a string. (English) Zbl 1390.68782 Theor. Comput. Sci. 700, 45-62 (2017). Reviewer: Travis Gagie (Helsinki) MSC: 68W32 68R15 PDFBibTeX XMLCite \textit{M. Amit} et al., Theor. Comput. Sci. 700, 45--62 (2017; Zbl 1390.68782) Full Text: DOI HAL
Crochemore, Maxime; Grossi, Roberto; Kärkkäinen, Juha; Landau, Gad M. Computing the Burrows-Wheeler transform in place and in small space. (English) Zbl 1328.68325 J. Discrete Algorithms 32, 44-52 (2015). MSC: 68W32 68Q25 PDFBibTeX XMLCite \textit{M. Crochemore} et al., J. Discrete Algorithms 32, 44--52 (2015; Zbl 1328.68325) Full Text: DOI
Crochemore, Maxime; Grossi, Roberto; Kärkkäinen, Juha; Landau, Gad M. A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform. (English) Zbl 1381.68313 Fischer, Johannes (ed.) et al., Combinatorial pattern matching. 24th annual symposium, CPM 2013, Bad Herrenalb, Germany, June 17–19, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38904-7/pbk). Lecture Notes in Computer Science 7922, 74-82 (2013). MSC: 68W32 68P05 PDFBibTeX XMLCite \textit{M. Crochemore} et al., Lect. Notes Comput. Sci. 7922, 74--82 (2013; Zbl 1381.68313) Full Text: DOI
Amit, Mika; Crochemore, Maxime; Landau, Gad M. Locating all maximal approximate runs in a string. (English) Zbl 1381.68309 Fischer, Johannes (ed.) et al., Combinatorial pattern matching. 24th annual symposium, CPM 2013, Bad Herrenalb, Germany, June 17–19, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38904-7/pbk). Lecture Notes in Computer Science 7922, 13-27 (2013). MSC: 68W32 PDFBibTeX XMLCite \textit{M. Amit} et al., Lect. Notes Comput. Sci. 7922, 13--27 (2013; Zbl 1381.68309) Full Text: DOI Link
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Rawitz, Dror; Vialette, Stéphane Approximating the 2-interval pattern problem. (English) Zbl 1142.68070 Theor. Comput. Sci. 395, No. 2-3, 283-297 (2008). MSC: 68W20 PDFBibTeX XMLCite \textit{M. Crochemore} et al., Theor. Comput. Sci. 395, No. 2--3, 283--297 (2008; Zbl 1142.68070) Full Text: DOI Link
Crochemore, Maxime; Hermelin, Danny; Landau, Gad M.; Vialette, Stéphane Approximating the 2-interval pattern problem. (English) Zbl 1123.68143 Brodal, Gerth Stølting (ed.) et al., Algorithms – ESA 2005. 13th annual European symposium, Palma de Mallorca, Spain, October 3–6, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29118-0/pbk). Lecture Notes in Computer Science 3669, 426-437 (2005). MSC: 68W25 92D20 PDFBibTeX XMLCite \textit{M. Crochemore} et al., Lect. Notes Comput. Sci. 3669, 426--437 (2005; Zbl 1123.68143) Full Text: DOI
Amir, Amihood; Butman, Ayelet; Crochemore, Maxime; Landau, Gad M.; Schaps, Mary Two-dimensional pattern matching with rotations. (English) Zbl 1070.68147 Theor. Comput. Sci. 314, No. 1-2, 173-187 (2004). MSC: 68W05 68W40 PDFBibTeX XMLCite \textit{A. Amir} et al., Theor. Comput. Sci. 314, No. 1--2, 173--187 (2004; Zbl 1070.68147) Full Text: DOI
Amir, Amihood; Butman, Ayelet; Crochemore, Maxime; Landau, Gad M.; Schaps, Malka Two-dimensional pattern matching with rotations. (English) Zbl 1279.68363 Baeza-Yates, Ricardo (ed.) et al., Combinatorial pattern matching. 14th annual symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25–27, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40311-6/pbk). Lecture Notes in Computer Science 2676, 17-31 (2003). MSC: 68W32 68W40 PDFBibTeX XMLCite \textit{A. Amir} et al., Lect. Notes Comput. Sci. 2676, 17--31 (2003; Zbl 1279.68363) Full Text: DOI
Crochemore, Maxime; Landau, Gad M.; Ziv-Ukelson, Michal A subquadratic sequence alignment algorithm for unrestricted scoring matrices. (English) Zbl 1253.74047 SIAM J. Comput. 32, No. 6, 1654-1673 (2003). MSC: 68W32 90C39 68P30 PDFBibTeX XMLCite \textit{M. Crochemore} et al., SIAM J. Comput. 32, No. 6, 1654--1673 (2003; Zbl 1253.74047) Full Text: DOI
Crochemore, Maxime; Landau, Gad M.; Ziv-Ukelson, Michal A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. (English) Zbl 1064.92017 Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 679-688 (2002). MSC: 92C40 92-08 90C39 90C90 PDFBibTeX XMLCite \textit{M. Crochemore} et al., in: Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2002, San Francisco, CA, USA, January 6--8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 679--688 (2002; Zbl 1064.92017)