Contacts page

Mira Abraham Department of Computer Science Tel-Aviv University Ramat Aviv 69978 Israel	E-mail: miraᏍpost.tau.ac.il Papers on our conference 2011: Inexact Graph Matching by “Geodesic Hashing” for the Alignment of Pseudoknoted RNA Secondary Structures
Don Adjeroh Lane Department of Computer Science and Electrical Engineering West Virginia University Morgantown, WV 26506 USA	E-mail: donᏍcsee.wvu.edu Papers on our conference 2008: The Virtual Suffix Tree: An Efficient Data Structure for Suffix Trees
Aharon Fruchtman Department of Computer Science and Mathematics Ariel University Ariel 40700 Israel	E-mail: aralefᏍgmail.com Papers on our conference 2019: Bidirectional Adaptive Compression
Ali Alatabbi Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: ali.alatabbiᏍkcl.ac.uk WWW: http://www.dcs.kcl.ac.uk/pg/alatabbi/ Papers on our conference 2013: Maximal Palindromic Factorization 2018: A Faster V-order String Comparison Algorithm
Julien Allali LaBRI University of Bordeaux I Unité Mixte de Recherche CNRS (UMR 5800) 351 Cours de la Lib\'eration 33405 Talence cedex, France	Papers on our conference 2006: The Gapped-Factor Tree 2009: Validation and Decomposition of Partially Occluded Images with Holes
Amihood Amir Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel Department of Computer Science Johns Hopkins University Baltimore, MD 21218	E-mail: amirᏍcs.biu.ac.il Papers on our conference 2004: Theoretical Issues of Searching Aerial Photographs: A Bird's Eye View 2005: Asynchronous Pattern Matching - Metrics 2017: Online Recognition of Dictionary with One Gap
Kazuaki Ando Department of Information Science and Intelligent Systems University of Tokushima 2-1 Minami-Josanjima-Cho Tokushima-Shi 770-8506 Japan	E-mail: AndoᏍis.tokushima-u.ac.jp Papers on our conference 1996: An Efficient Multi-Attribute Pattern Matching Machine 1998: A Fast Morphological Analysis Using the Extended AC Machine for Oriental Languages
Gabriela Andrejková Department of Computer Science, College of Science, P.J. Safarik University Jesenna 5 041 54 Kosice Slovakia	E-mail: gabriela.andrejkovaᏍupjs.sk WWW: ics.upjs.sk/~andrejkova/ Papers on our conference 1998: The Longest Restricted Common Subsequence Problem 1999: The Closest Common Subsequence Problems 2000: The Set-Set Closest Common Subsequence Problem
Anatoly V. Anisimov Taras Shevchenko National University of Kyiv 2d Glushkova ave., Kyiv, Ukraine	Papers on our conference 2016: A Family of Data Compression Codes with Multiple Delimiters
Antonio Scardace Dipartimento di Scienze Cognitive Università di Messina via Concezione n.6 98122, Messina, Italia	E-mail: Papers on our conference 2021: Towards an Efficient Text Sampling Approach for Exact and Approximate Matching
Pavlos Antoniou Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: pavlos.antoniouᏍkcl.ac.uk Papers on our conference 2008: Conservative String Covering of Indeterminate Strings 2009: Validation and Decomposition of Partially Occluded Images with Holes
Jan Antoš	Papers on our conference 2005: Backward Pattern Matching Automaton
Jun-ichi Aoe Department of Information Science and Intelligent Systems University of Tokushima 2-1 Minami-Josanjima-Cho Tokushima-Shi 770-8506 Japan	E-mail: aoeᏍis.tokushima-u.ac.jp Papers on our conference 1996: An Efficient Multi-Attribute Pattern Matching Machine 1997: An Efficient Trie Hashing Method Using a Compact Binary Trie 1998: A Fast Morphological Analysis Using the Extended AC Machine for Oriental Languages
Setsuo Arikawa Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: arikawaᏍi.kyushu-u.ac.jp Papers on our conference 2001: Construction of the CDAWG for a Trie 2002: A Note on Randomized Algorithm for String Matching with Mismatches
Hiroki Arimura Hokkaido University Graduate School of Information Science and Technology Kita 14, Nishi 9 Kita-ku, Sapporo	E-mail: arimᏍist.hokudai.ac.jp Papers on our conference 2011: Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations 2013: Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams 2014: Fast Regular Expression Matching Based On Dual Glushkov NFA
Libor Aronovich IBM Canada Limited 8200 Warden Avenue Markham ON L6G 1C7 Canada	E-mail: aronovicᏍil.ibm.com Papers on our conference 2012: Similarity Based Deduplication with Small Data Chunks
Abdullah N. Arslan Department of Computer Science University of Vermont Burlington USA	E-mail: aarslanᏍcs.uvm.edu Papers on our conference 2004: Algorithms for the Constrained Longest Common Subsequence Problems
Ron Asher IBM - Diligent IBM Israel HQ, Azorim Park 94 Em Hamoshavot Rd. Kiryat Arie, Petach Tiqva, 49527, Israel	E-mail: ronasherᏍil.ibm.com Papers on our conference 2012: Similarity Based Deduplication with Small Data Chunks
Avivit Levy Department of Software Engineering Shenkar College, Ramat-Gan 52526, Israel	E-mail: avivitlevyᏍshenkar.ac.il Papers on our conference 2017: Online Recognition of Dictionary with One Gap 2019: Online Parameterized Dictionary Matching with One Gap
Kamil Awid Centre for Artificial Intelligence Research Meiring Naude Road Pretoria South Africa	E-mail: kamilᏍfastar.org Papers on our conference 2016: Using Human Computation in Dead-zone based 2D Pattern Matching
Rafael D. de Azevedo Center for Telecommunications Studies (CETUC) Catholic University of Rio de Janeiro Marqus de S. Vincente, 255 22453-900 RIO DE JANEIRO, RJ Brazil	Papers on our conference 1999: On Procedures for Multiple-string Match with Respect to Two Sets
B. Riva Shalom Department of Software Engineering Shenkar College, Ramat-Gan 52526, Israel	E-mail: rivashᏍshenkar.ac.il Papers on our conference 2017: Online Recognition of Dictionary with One Gap 2018: Parameterized Dictionary Matching with One Gap 2019: Online Parameterized Dictionary Matching with One Gap
Kensuke Baba PRESTO, Japan Science and Technology Corporation Honcho 4-1-8, Kawaguchi City Saitama 332-0012 Japan	E-mail: babaᏍi.kyushu-u.ac.jp Papers on our conference 2002: A Note on Randomized Algorithm for String Matching with Mismatches 2003: An Efficient Mapping for Score of String Matching
Golnaz Badkobeh Department of Computer Science and Engineering University of Sheffield Regent Court 211 Portobello Sheffield S1 4DP United Kingdom	Papers on our conference 2010: Bounded Number of Squares in Infinite Repetition-Constrained Binary Words 2014: Closed Factorization 2019: k-Abelian Pattern Matching: Revisited, Corrected, and Extended 2020: Left Lyndon Tree Construction
Haoyue Bai Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: baih3Ꮝmcmaster.ca Papers on our conference 2014: Two Squares Canonical Factorization
Dipankar Ranjan Baisya Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka, Bangladesh	Papers on our conference 2013: Degenerate String Reconstruction from Cover Arrays
Andrew Baker Department of Computing&Software Faculty of Engineering McMaster University Hamilton, Ontario Canada L8S 4K1	E-mail: bakerar2Ꮝmcmaster.ca Papers on our conference 2011: A Parameterized Formulation for the Maximum Number of Runs Problem
Miroslav Balík Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Miroslav.BalikᏍfit.cvut.cz phone: (+420) 224 359 874 Papers on our conference 1998: Implementation of DAWG 2000: Condensation Principle
Hideo Bannai Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: bannaiᏍinf.kyushu-u.ac.jp WWW: www.i.kyushu-u.ac.jp/~bannai/ Papers on our conference 2006: Reachability on Suffix Tree Graphs 2008: Parameterized Suffix Arrays for Binary Strings 2008: New Lower Bounds for the Maximum Number of Runs in a String 2009: Finding Characteristic Substrings from Compressed Texts 2009: Bit-parallel algorithms for computing all the runs in a string 2010: The Number of Runs in a Ternary Word 2011: Efficient Eager XPath Filtering over XML Streams 2011: Inferring Strings from Suffix Trees and Links on a Binary Alphabet 2011: Computing Longest Common Substring/Subsequence of Non-linear Texts 2013: Computing Reversed Lempel-Ziv Factorization Online 2014: Computing Abelian Covers and Abelian Runs 2014: Closed Factorization 2015: Computing Left-Right Maximal Generic Words 2016: Computing Smallest and Largest Repetition Factorizations in O(n log n) Time 2016: Dynamic Index and LZ Factorization in Compressed Space 2017: On Reverse Engineering the Lyndon Tree 2018: O(n log n)-time Text Compression by LZ-style Longest First Substitution 2018: Right-to-left Online Construction of Parameterized Position Heaps 2019: Computing Maximal Palindromes and Distinct Palindromes in a Trie 2019: k-Abelian Pattern Matching: Revisited, Corrected, and Extended
Md. Faizul Bari Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka, Bangladesh	E-mail: faizulbariᏍcse.buet.ac.bd Papers on our conference 2009: Finding all covers of an indeterminate string in O(n) time on average
Gilad Baruch Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel	E-mail: gilad.baruchᏍgmail.com Papers on our conference 2016: Accelerated Partial Decoding in Wavelet Trees 2017: Range Queries Using Huffman Wavelet Trees
Kamila Barylska Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: kamila.barylskaᏍmat.umk.pl Papers on our conference 2016: Generating All Minimal Petri Net Unsolvable Binary Words
Paweł Baturo Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: Papers on our conference 2008: Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
David Becerra Department of System Engineering and Industrial Engineering National University of Colombia Colombia	E-mail: dcbecerrarᏍunal.edu.co Papers on our conference 2012: A Multiobjective Approach to the Weighted Longest Common Subsequence Problem
Behshad Behzadi Laboratoire d'Informatique (LIX) Ecole Polytechnique Palaiseau Cedex France	E-mail: behzadiᏍlix.polytechnique.fr WWW: www.lix.polytechnique.fr/Labo/Behshad.Behzadi/ phone: +33 1 69 33 34 79 Papers on our conference 2003: The Transformation Distance Problem Revisited
Noud de Beijer FASTAR Finite Automata Systems – Theoretical and Applied Research group Department of Computer Science, University of Pretoria Pretoria 0002 Republic of South Africa	E-mail: nouddebeijerᏍgmail.com Papers on our conference 2010: Improving Automata Efficiency by Stretching and Jamming
Miri Ben-Nissan Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel	E-mail: miribnᏍgmail.com Papers on our conference 2006: Working with Compressed Concordances
Kirke Bent Parallel Business Software 29 Pine Street Chatham NJ 07928, USA	E-mail: parbzsftᏍbellatlantic.net Papers on our conference 2002: A Recursive Function for Calculating the Number of Legal Strings of Parentheses and for Calculating Catalan Numbers
Ekaterina Benza Department of Computer Science and Mathematics Ariel University Ariel 40700 Israel	E-mail: benzakateᏍgmail.com Papers on our conference 2018: Fibonacci Based Compressed Suffix Array
Martin Berglund Department of Computing Science, Umeå University, 90187 Umeå Sweden	E-mail: mbeᏍcs.umu.se Papers on our conference 2010: On the Complexity of Variants of the k Best Strings Problem 2011: Analyzing Edit Distance on Trees: Tree Swap Distance is Intractable 2017: Regular Expressions with Backreferences Re-examined
Thomas Berry Department of Computer Science Liverpool John Moores University Byrom Street Liverpool United Kingdom	E-mail: T.BerryᏍlivjm.ac.uk Papers on our conference 1999: A Fast String Matching Algorithm and Experimental Results 2001: Searching in an Efficiently Stored DNA Text Using a Hardware Solution 2001: A linear time string matching algorithm on average with efficient text storage
Wojciech Bieniecki Computer Engineering Department Technical University of Łódź Al. Politechniki 11, 90–924 Łódź Poland	E-mail: wbieniecᏍkis.p.lodz.pl Papers on our conference 2010: Tight and Simple Web Graph Compression
Lucie Bittner Sorbone Universités Paris, France	Papers on our conference 2016: A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics
Martin Bloch Dept. of Comp. Sci. & Eng. Faculty of Electrical Eng. Czech Technical University in Prague Prague	E-mail: blochᏍfel.cvut.cz WWW: cs.felk.cvut.cz/webis/people/bloch.html phone: (+420) 224 357 251 Papers on our conference 1996: Efficiency of AC-Machine and SNFA in Practical String Matching
Stefano Borzi Università di Catania Viale Andrea Doria 6 95125 Catania Italy	Papers on our conference 2016: The String Matching Algorithms Research Tool
Leendert Botha Department of Mathematical Sciences, Computer Science Division, Stellenbosch University, Private Bag X1, 7602 Matieland, South Africa	E-mail: lbothaᏍcs.sun.ac.za WWW: http://www.cs.sun.ac.za/~lbotha/ Papers on our conference 2009: Feature Extraction for Image Pattern Matching with Cellular Automata
Béatrice Bouchou Université François Rabelais de Tours LI/Campus de Blois, France 3 place Jean Jaurés 41000 Blois, France	E-mail: beatrice.bouchouᏍuniv-tours.fr Papers on our conference 2005: Incremental String Correction: Towards Correction of XML Documents
Gerhard Brey Centre for Computing in the Humanities King's College London 26-29 Drury Lane London WC2B 5RL England	E-mail: gerhard.breyᏍkcl.ac.uk Papers on our conference 2008: Edit Distance with Single-Symbol Combinations and Splits
Srečko Brlek Laboratoire de Combinatoire et d'Informatique Mathèmatique Universitè du Quèbec à Montrèal CP 8888, Succ. Centre-ville Montrèal H3C3P8 Canada	E-mail: brlekᏍlacim.uqam.ca WWW: http://www.lacim.uqam.ca/~brlek/ Papers on our conference 2006: On the Problem of Deciding If a Polyomino Tiles the Plane by Translation
Johannes Bubenzer Department of Linguistics University of Potsdam Karl-Liebknecht-Strasse 24-25 14476 Potsdam	E-mail: bubenzerᏍuni-potsdam.de Papers on our conference 2011: Minimization of Acyclic DFAs
Stefan Burkhardt Max-Planck-Institut fur Informatik Stuhlsatzenhausweg 85 66123 Saarbrucken Germany	E-mail: stburkᏍmpi-sb.mpg.de Papers on our conference 2004: BDD-Based Analysis of Gapped q-Gram Filters
Matteo Campanelli Scuola Superiore di Catania Università di Catania Via San Nullo 5/i I-95123 Catania Italy	E-mail: macampanelliᏍssc.unict.it Papers on our conference 2009: An Efficient Algorithm for Approximate Pattern Matching with Swaps
Can Yılmaz Altıniğne School of Computer and Communication Sciences EPFL, Zurich, Switzerland	E-mail: can.altinigneᏍepfl.ch Papers on our conference 2020: Enumerative Data Compression with Non-Uniquely Decodable Codes
Domenico Cantone Dipartimento di Matematica e Informatica Le facolta scienze matematiche, fisiche e naturali Università di Catania Viale Andrea Doria 6 95125 Catania Italy	E-mail: cantoneᏍdmi.unict.it Papers on our conference 2003: Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm 2004: Efficient Algorithms for the δ-Approximate String Matching Problem in Musical Sequences 2005: A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem 2006: On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences 2008: New Efficient Bit-Parallel Algorithms for the δ-Matching Problem with α-Bounded Gaps in Musical Sequences 2009: Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts 2009: An Efficient Algorithm for Approximate Pattern Matching with Swaps 2010: Approximate String Matching Allowing for Inversions and Translocations 2010: A Space-Efficient Implementation of the Good-Suffix Heuristic 2013: Improved and Self-Tuned Occurrence Heuristics 2014: Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata 2015: An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem 2017: Speeding Up String Matching by Weak Factor Recognition
Iván Castellanos Department of System Engineering and Industrial Engineering National University of Colombia Colombia	E-mail: iycastellanosmᏍunal.edu.co Papers on our conference 2015: Efficient Algorithm for δ-Approximate Jumbled Pattern Matching
Bastien Cazaux Laboratoire Informatique Robotique Microelectonique Montpellier L.I.R.M.M. Universite Montpellier II CNRS U.M.R. 5506 161 rue Ada, F--34392 Montpellier Cedex 5 France	E-mail: cazauxᏍlirmm.fr Papers on our conference 2014: Approximation of Greedy Algorithms for Max-ATSP, Maximal Compression, Maximal Cycle Cover, and Shortest Cyclic Cover of Strings
Cedric Chauve Department of Mathematics Simon Fraser University 8888 University Drive, Burnaby, BC, V5A 1S6 Canada LaBRI University of Bordeaux I Unité Mixte de Recherche CNRS (UMR 5800) 351 Cours de la Lib\'eration 33405 Talence cedex, France	E-mail: Papers on our conference 2021: Refined Upper Bounds on the Size of the Condensed Neighbourhood of Sequences
Jean-Marc Champarnaud LIFAR Universite de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: champarnaudᏍdir.univ-rouen.fr WWW: jmc.feydakins.org WWW: www.univ-rouen.fr/psi Papers on our conference 2002: Split and join for minimizing: Brzozowski's algorithm
Christian Charras Université de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: Christian.CharrasᏍdir.univ-rouen.fr WWW: www.dir.univ-rouen.fr/~charras/ Papers on our conference 1998: Exact String Matching Animation in Java
Ahmed Cheriat Université François Rabelais de Tours LI/Campus de Blois, France 3 place Jean Jaurés 41000 Blois, France	E-mail: ahmed.cheriatᏍetu.univ-tours.fr Papers on our conference 2005: Incremental String Correction: Towards Correction of XML Documents
Manolis Christodoulakis School of Computing & Technology University of East London Docklands Campus, 4-6 University Way London E16 2RD England	E-mail: m.christodoulakisᏍuel.ac.uk Papers on our conference 2003: Approximate Seeds of Strings 2006: Song Classifications for Dancing 2008: Edit Distance with Single-Symbol Combinations and Splits
Ferdinando Cicalese Dipartimento di Informatica ed Applicazioni Università di Salerno Italy	E-mail: cicaleseᏍdia.unisa.it Papers on our conference 2009: Searching for Jumbled Patterns in Strings
Luigi Cinque Computer Science Department Università di Roma "La Sapienza" Via Salaria 113 00198 Rome Italy	E-mail: cinqueᏍdi.uniroma1.it Papers on our conference 2004: A Simple Lossless Compression Heuristic for Grey Scale Images 2008: Lossless Image Compression by Block Matching on Practical Massively Parallel Architectures 2008: Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine 2010: Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and Scalability 2011: Binary Image Compression via Monochromatic Pattern Substitution: A Sequential Speed-Up
M. Clausen Institut für Informatik Universität Bonn Endenicher Allee 19A D-53115 Bonn Germany	E-mail: ClausenᏍcs.uni-bonn.de Papers on our conference 1999: A New Practical Linear Space Algorithm for the Longest Common Subsequence Problem
Loek Cleophas FASTAR Finite Automata Systems – Theoretical and Applied Research group Department of Mathematical Sciences, Computer Science Division, Stellenbosch University, Private Bag X1, 7602 Matieland, South Africa Department of Mathematics and Computer Science Technische Universiteit Eindhoven P.O. Box 513, NL-5600 MB Eindhoven The Netherlands	E-mail: loekᏍloekcleophas.com WWW: www.win.tue.nl/~lcleopha phone: 040 - 247 2865/5145 Papers on our conference 2003: Constructing Factor Oracles 2005: A Missing Link in Root-to-Frontier Tree Pattern Matching 2006: Efficient Automata Constructions and Approximate Automata 2009: Taxonomies of Regular Tree Algorithms 2009: On Minimizing Deterministic Tree Automata 2010: Improving Automata Efficiency by Stretching and Jamming 2011: On Compile Time Knuth-Morris-Pratt Precomputation 2012: Failure Deterministic Finite Automata 2013: Weak Factor Automata: Comparing (Failure) Oracles and Storacles 2014: A Process-Oriented Implementation of Brzozowski's DFA Construction Algorithm 2014: Using Correctness-by-Construction to Derive Dead-zone Algorithms 2015: Quantum Leap Pattern Matching 2016: Using Human Computation in Dead-zone based 2D Pattern Matching 2017: Many-MADFAct: Concurrently Constructing MADFAs
Raphaël Clifford Department of Computer Science, University of Bristol, Merchant Venturer's Building Woodland Road, Bristol, BS8 1UB United Kingdom	E-mail: cliffordᏍcs.bris.ac.uk Papers on our conference 2010: (In)approximability Results for Pattern Matching Problems
Wikus Coetser Department of Computer Science, University of Pretoria Pretoria 0002 Republic of South Africa	E-mail: spring.haas.meesterᏍgmail.com Papers on our conference 2008: On Regular Expression Hashing to Reduce FA Size
Richard Cole Computer Science Department Courant Institute of Mathematical Sciences New York University U.S.A.	E-mail: coleᏍcs.nyu.edu WWW: www.cs.nyu.edu/cs/faculty/cole/ phone: (212) 998-3119 Papers on our conference 2003: Computing the Minimum k-Cover of a String
Ehud S. Conley Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel	E-mail: konliᏍcs.biu.ac.il Papers on our conference 2006: Using Alignment for Multilingual Text Compression
François Coste IRISA/INRIA Rennes Bretagne Atlantique Campus de Beaulieu 35042 Rennes Cedex France	E-mail: francois.costeᏍirisa.fr Papers on our conference 2008: In-place Update of Suffix Array while Recoding Words
Salvatore Cristofaro Dipartimento di Matematica e Informatica Le facolta scienze matematiche, fisiche e naturali Università di Catania Viale Andrea Doria 6 95125 Catania Italy	E-mail: cristofaroᏍdmi.unict.it Papers on our conference 2004: Efficient Algorithms for the δ-Approximate String Matching Problem in Musical Sequences 2006: On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences 2008: New Efficient Bit-Parallel Algorithms for the δ-Matching Problem with α-Bounded Gaps in Musical Sequences 2010: A Space-Efficient Implementation of the Good-Suffix Heuristic
Maxime Crochemore Department of Computer Science King's College London Strand, London WC2R 2LS England Université Paris-Est 77454 Marne-la-Vallée Cedex 2 France	E-mail: Maxime.CrochemoreᏍkcl.ac.uk WWW: www.dcs.kcl.ac.uk/staff/mac/ WWW: www-igm.univ-mlv.fr/~mac/index_en.html Papers on our conference 2001: Approximate String Matching in Musical Sequences 2008: Conservative String Covering of Indeterminate Strings 2009: On-line construction of a small automaton for a finite set of words 2010: Reactive Links to Save Automata States 2010: New Simple Efficient Algorithms Computing Powers and Runs in Strings 2010: Bounded Number of Squares in Infinite Repetition-Constrained Binary Words 2019: k-Abelian Pattern Matching: Revisited, Corrected, and Extended 2020: Left Lyndon Tree Construction
Cyril Nicaud Université Paris-Est 77454 Marne-la-Vallée Cedex 2 France	E-mail: cyril.nicaudᏍu-pem.fr Papers on our conference 2023: Theoretical Perspectives on Algorithmic Choices Made in Programming Languages
Ahmad Daaboul Institut Gaspard-Monge Universite de Marne-la-Vallee France	E-mail: DaaboulᏍmonge.univ-mlv.fr Papers on our conference 1998: Local Prediction for Lossless Image Compression
Dana Pardubská Department of Computer Science Faculty of Mathematics, Physics and Informatics Comenius University in Bratislava	Papers on our conference 2019: Lexicalized Syntactic Analysis by Restarting Automata
Dana Shapira Department of Computer Science and Mathematics Ariel University Ariel 40700 Israel	E-mail: shapirdᏍg.ariel.ac.il Papers on our conference 2005: Compressed Pattern Matching in JPEG Images 2006: Modeling Delta Encoding of Compressed Files 2008: Huffman Coding with Non-Sorted Frequencies 2009: On the Usefulness of Backspace 2010: Practical Fixed Length Lempel Ziv Coding 2014: Random Access to Fibonacci Codes 2014: Metric Preserving Dense SIFT Compression 2015: Enhanced Extraction from Huffman Encoded Files 2015: Controlling the Chunk-Size in Deduplication Systems 2016: Accelerated Partial Decoding in Wavelet Trees 2017: Range Queries Using Huffman Wavelet Trees 2018: Fibonacci Based Compressed Suffix Array 2018: Synchronizing Dynamic Huffman Codes 2019: Bidirectional Adaptive Compression 2019: Selective Dynamic Compression 2020: New Compression Schemes for Natural Number Sequences 2023: Selective Weighted Adaptive Coding 2023: Turning Compression Schemes into Crypto-Systems
Shibsankar Das	E-mail: reach_shibsankardasᏍyahoo.com phone:
David Kübel Institut für Informatik Universität Bonn Endenicher Allee 19A D-53115 Bonn Germany	E-mail: kuebelᏍcs.uni-bonn.de Papers on our conference 2020: On Arithmetically Progressed Suffix Arrays
Jacqueline W. Daykin Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: jackie.daykinᏍkcl.ac.uk Papers on our conference 2018: A Faster V-order String Comparison Algorithm 2018: Three Strategies for the Dead-Zone String Matching Algorithm 2020: On Arithmetically Progressed Suffix Arrays
Satoshi Deguchi Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: satoshi.deguchiᏍi.kyushu-u.ac.jp Papers on our conference 2008: Parameterized Suffix Arrays for Binary Strings
Shuhei Denzumi Hokkaido University Graduate School of Information Science and Technology Kita 14, Nishi 9 Kita-ku, Sapporo	E-mail: denzumiᏍist.hokudai.ac.jp Papers on our conference 2011: Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations 2013: Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams
Antonie Deza Department of Computing&Software Faculty of Engineering McMaster University Hamilton, Ontario Canada L8S 4K1 Equipe Combinatoire et Optimisation Université Pierre et Marie Curie 4 place Jussieu 75005 Paris, France	E-mail: dezaᏍmcmaster.ca Papers on our conference 2011: A Parameterized Formulation for the Maximum Number of Runs Problem 2012: A Computational Framework for Determining Square-maximal Strings
Simone Di Mauro Università di Catania Viale Andrea Doria 6 95125 Catania Italy	Papers on our conference 2016: The String Matching Algorithms Research Tool
Diptarama Graduate School of Information Science Tohoku University Aramaki aza Aoba 6-6-05, Aoba-ku Sendai 980-8579 Japan	E-mail: diptaramaᏍshino.ecei.tohoku.ac.jp Papers on our conference 2016: Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings 2019: An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm
O.C. Dogaru West University of Timisoara Bd.V.Parvan, nr. 4 Timisoara, 1900 Romania	E-mail: DogaruᏍinfo.uvt.ro Papers on our conference 1998: On the All Occurrences of a Word in a Text
Dominik Köppl Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: dominik.koepplᏍinf.kyushu-u.ac.jp
Frank Drewes Department of Computing Science, Umeå University, 90187 Umeå Sweden	E-mail: drewesᏍcs.umu.se Papers on our conference 2010: On the Complexity of Variants of the k Best Strings Problem
Branislav Ďurian S&T Slovakia s.r.o. Priemyselná 2, SK--010 01 Žilina, Slovakia	E-mail: Branislav.DurianᏍsnt.sk Papers on our conference 2014: Improved Two-Way Bit-parallel Search
Jean-Pierre Duval Université de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: Jean-Pierre.DuvalᏍuniv-rouen.fr Papers on our conference 2002: Border Array on Bounded Alphabet
Jiří Dvorský Computer Science Department Palacky University of Olomouc Tomkova 40 779 00 Olomouc Czech Republic	E-mail: jiri.dvorskyᏍupol.cz Papers on our conference 2000: Word-based Compression Method with Direct Access
Omer Egecioglu Department of Computer Science University of California, Santa Barbara USA	E-mail: omerᏍcs.ucsb.edu Papers on our conference 2004: Algorithms for the Constrained Longest Common Subsequence Problems
Elif Altunok Informatics Institute Istanbul Technical University, Istanbul, Turkey	E-mail: altunokᏍitu.edu.tr Papers on our conference 2020: Enumerative Data Compression with Non-Uniquely Decodable Codes
Elina Opalinsky Department of Computer Science and Mathematics Ariel University Ariel 40700 Israel	E-mail: elinaoᏍariel.ac.il Papers on our conference 2018: Synchronizing Dynamic Huffman Codes 2019: Selective Dynamic Compression 2023: Selective Weighted Adaptive Coding
Eliška Šestáková Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: eliska.sestakovaᏍfit.cvut.cz phone: Papers on our conference 2018: Constrained Approximate Subtree Matching by Finite Automata 2021: Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance
Ely Porat Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel	E-mail: poratelyᏍᏍcs.biu.ac.il Papers on our conference 2017: Online Recognition of Dictionary with One Gap
Enno Ohlebusch Institute of Theoretical Computer Science Ulm University 89069 Ulm Germany	E-mail: Enno.OhlebuschᏍuni-ulm.de Papers on our conference 2017: A Lempel-Ziv-style Compression Method for Repetitive Texts
Eric Rivals Laboratoire Informatique Robotique Microelectonique Montpellier L.I.R.M.M. Universite Montpellier II CNRS U.M.R. 5506 161 rue Ada, F--34392 Montpellier Cedex 5 France	E-mail: rivalsᏍlirmm.fr Papers on our conference 2023: Periodicity of Degenerate Strings
Evgeny Erofeev Parallel Systems, Department of Computing Science Carl von Ossietzky Universitat Oldenburg Germany	E-mail: evgeny.erofeevᏍinformatik.uni-oldenburg.de Papers on our conference 2016: Generating All Minimal Petri Net Unsolvable Binary Words
Estéban Gabory Centrum Wiskunde&Informatica, Amsterdam, The Netherlands	E-mail: esteban.gaboryᏍcwi.nl Papers on our conference 2023: Periodicity of Degenerate Strings
Simone Faro Dipartimento di Matematica e Informatica Le facolta scienze matematiche, fisiche e naturali Università di Catania Viale Andrea Doria 6 95125 Catania Italy	E-mail: faroᏍdmi.unict.it WWW: www.dmi.unict.it/~faro/ Papers on our conference 2003: Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm 2004: Efficient Algorithms for the δ-Approximate String Matching Problem in Musical Sequences 2005: A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem 2006: On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences 2008: Efficient Variants of the Backward-Oracle-Matching Algorithm 2008: New Efficient Bit-Parallel Algorithms for the δ-Matching Problem with α-Bounded Gaps in Musical Sequences 2009: Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts 2009: An Efficient Algorithm for Approximate Pattern Matching with Swaps 2010: Approximate String Matching Allowing for Inversions and Translocations 2010: A Space-Efficient Implementation of the Good-Suffix Heuristic 2011: 2001–2010: Ten Years of Exact String Matching Algorithms 2013: Swap Matching in Strings by Simulating Reactive Automata 2013: Towards a Very Fast Multiple String Matching Algorithm for Short Patterns 2013: Improved and Self-Tuned Occurrence Heuristics 2014: Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata 2015: An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem 2015: Refined Tagging of Complex Verbal Phrases for the Italian Language 2016: The String Matching Algorithms Research Tool 2017: Speeding Up String Matching by Weak Factor Recognition 2020: Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings 2020: Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling 2021: Towards an Efficient Text Sampling Approach for Exact and Approximate Matching
Abolfazl Fatholahzadeh Supelec - Campus de Metz 2, rue Edouard Belin 57078 Metz France	E-mail: Abolfazl.FatholahzadehᏍsupelec.fr Papers on our conference 2003: Learning the Morphological Features of a Large Set of Words
Mir Md. Faysal Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka, Bangladesh	Papers on our conference 2013: Degenerate String Reconstruction from Cover Arrays
Maria Federico Dipartimento di Ingegneria dell'Informazione Università degli Studi di Modena e Reggio Emilia Viale A. Allegri 9, 42121 Reggio Emilia	E-mail: maria.federicoᏍunimore.it WWW: http://algo.ing.unimo.it/people/maria/index.html Papers on our conference 2011: Finding Long and Multiple Repeats with Edit Distance
Matthew Felice Pace Department of Computer Science The University of Warwick University of Warwick, Coventry CV4 7AL, UK	E-mail: M.Felice-PaceᏍwarwick.ac.uk WWW: www2.warwick.ac.uk/fac/sci/dcs/people/research/csrhap/ Papers on our conference 2013: Parallel Suffix Array Construction by Accelerated Sampling
Fernando J. Fiori Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: fiorifjᏍgmail.com Papers on our conference 2017: Counting Mismatches with SIMD
Mírian Halfeld Ferrari Université François Rabelais de Tours LI/Campus de Blois, France 3 place Jean Jaurés 41000 Blois, France	E-mail: mirianᏍuniv-tours.fr Papers on our conference 2005: Incremental String Correction: Towards Correction of XML Documents
Pascal Ferraro LaBRI University of Bordeaux I Unité Mixte de Recherche CNRS (UMR 5800) 351 Cours de la Lib\'eration 33405 Talence cedex, France	Papers on our conference 2009: Validation and Decomposition of Partially Occluded Images with Holes
Gabriele Fici Universita di Palermo Dipartimento di Matematica e Informatica Via Archirafi 34 90123 Palermo Italy	E-mail: gabriele.ficiᏍunipa.it WWW: http://math.unipa.it/fici/ Papers on our conference 2009: Searching for Jumbled Patterns in Strings 2011: Computing Abelian Periods in Words 2012: Quasi-linear Time Computation of the Abelian Periods of a Word
Filip Pavetić Google Switzerland GmbH. Zürich	E-mail: fpaveticᏍgoogle.com Papers on our conference 2018: Fast and Simple Algorithms for Computing both LCSk and LCSk+
Weiler A. Finamore Center for Telecommunications Studies (CETUC) Catholic University of Rio de Janeiro Marqus de S. Vincente, 255 22453-900 RIO DE JANEIRO, RJ Brazil	E-mail: WeilerᏍcetuc.pur-rio.br Papers on our conference 1999: On Procedures for Multiple-string Match with Respect to Two Sets
Florian Kurpicz Department of Computer Science Technische Universität Dortmund Germany	E-mail: florian.kurpiczᏍtu-dortmund.de Papers on our conference 2017: Dismantling DivSufSort
Florian Stober FMI, Universität Stuttgart Universitätsstraße 38, 70569 Stuttgart, Germany	E-mail: florian.stoberᏍt-online.de Papers on our conference 2020: On Arithmetically Progressed Suffix Arrays
Tomáš Flouri Heidelberg Institute for Theoretical Studies HITS gGmbH Schloss-Wolfsbrunnenweg 35 D-69118 Heidelberg, Germany	E-mail: tomas.flouriᏍh-its.org Papers on our conference 2012: New and Efficient Approaches to the Quasiperiodic Characterisation of a String
Marc Fontaine Max-Planck-Institut fur Informatik Stuhlsatzenhausweg 85 66123 Saarbrucken Germany	E-mail: fontaineᏍstudcs.uni-sb.de Papers on our conference 2004: BDD-Based Analysis of Gapped q-Gram Filters
France Paquet-Nadeau Department of Mathematics Simon Fraser University 8888 University Drive, Burnaby, BC, V5A 1S6 Canada	E-mail: Papers on our conference 2021: Refined Upper Bounds on the Size of the Condensed Neighbourhood of Sequences
Francesco Pio Marino Dipartimento di Matematica e Informatica Le facolta scienze matematiche, fisiche e naturali Università di Catania Viale Andrea Doria 6 95125 Catania Italy	Papers on our conference 2020: Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling 2021: Towards an Efficient Text Sampling Approach for Exact and Approximate Matching
Frantisek Franek Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: franekᏍmcmaster.ca WWW: www.cas.mcmaster.ca/~franek/ phone: 1-905-525-9140 ext. 23233 Papers on our conference 2000: Repetitions in two-pattern strings 2002: A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach 2004: Sorting suffixes of two-pattern strings 2005: Reconstructing a Suffix Array 2006: An Asymptotic Lower Bound for the Maximal-Number-of-Runs Function 2009: Crochemore's repetitions algorithm revisited–computing runs 2011: A Parameterized Formulation for the Maximum Number of Runs Problem 2011: An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning Algorithm 2012: A Computational Framework for Determining Square-maximal Strings 2014: On the Number of Distinct Squares 2014: Two Squares Canonical Factorization 2016: Algorithms to Compute the Lyndon Array 2017: The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array 2018: On Baier's Sort of Maximal Lyndon Substrings 2019: Algorithms to Compute the Lyndon Array Revisited 2021: Computational Substantiation of the d-step Conjecture for Distinct Squares Revisited
František Franěk Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: franekᏍmcmaster.ca WWW: www.cas.mcmaster.ca/~franek/ phone: 1-905-525-9140 ext. 23233
František Mráz Faculty of Mathematics and Physics Charles University Czech Republic	Papers on our conference 2019: Lexicalized Syntactic Analysis by Restarting Automata
Kimmo Fredriksson School of Computing University of Eastern Finland PO Box 1627, FI--70211 Kuopio Finland	E-mail: kimmo.fredrikssonᏍuef.fi phone: +358 9 191 44119 Papers on our conference 2005: Flexible Music Retrieval in Sublinear Time 2006: Efficient Algorithms for (δ, γ, α)-Matching 2014: Multiple Pattern Matching Revisited
Friedrich Otto Faculty of Mathematics and Physics Charles University Czech Republic	Papers on our conference 2019: Lexicalized Syntactic Analysis by Restarting Automata
Masao Fuketa Department of Information Science and Intelligent Systems University of Tokushima 2-1 Minami-Josanjima-Cho Tokushima-Shi 770-8506 Japan	Papers on our conference 1998: A Fast Morphological Analysis Using the Extended AC Machine for Oriental Languages
Dov M. Gabbay Department of Computer Science King's College London Strand, London WC2R 2LS England	WWW: www.dcs.kcl.ac.uk/staff/dg/ Papers on our conference 2010: Reactive Links to Save Automata States
Matthias Gallé IRISA/INRIA Rennes Bretagne Atlantique Campus de Beaulieu 35042 Rennes Cedex France	E-mail: matthias.galleᏍirisa.fr Papers on our conference 2008: In-place Update of Suffix Array while Recoding Words
Christian Gautier UMR 5558 CNRS Biométrie et Biologie Evolutive Université Claude Bernard Lyon 1 43, Bd. du 11 Novembre 1918 69622 Villeurbanne cedex France	Papers on our conference 2006: A Markovian Approach for the Analysis of the Gene Structure
Laura Giambruno Dipartimento di Matematica e Applicazioni, Università di Palermo, Palermo, Italy	E-mail: lgiambrᏍmath.unipa.it Papers on our conference 2009: On-line construction of a small automaton for a finite set of words
Emanuele Giaquinta Department of Computer Science University of Helsinki PO Box 68, FI--00014, Finland	E-mail: giaquintaᏍdmi.unict.it Papers on our conference 2009: Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts 2009: An Efficient Algorithm for Approximate Pattern Matching with Swaps 2010: Approximate String Matching Allowing for Inversions and Translocations 2014: Alternative Algorithms for Lyndon Factorization
Mathieu Giraud Université Lille, France	Papers on our conference 2010: The Number of Runs in a Ternary Word
Radosław Głowinski Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: glowirᏍmat.umk.pl Papers on our conference 2011: Observations On Compressed Pattern-Matching with Ranked Variables in Zimin Words
H. Goeman Institut für Informatik Universität Bonn Endenicher Allee 19A D-53115 Bonn Germany	E-mail: GoemanᏍcs.uni-bonn.de Papers on our conference 1999: A New Practical Linear Space Algorithm for the Longest Common Subsequence Problem
Golnaz Badkobeh Department of Computing Goldsmiths University of London United Kingdom	Papers on our conference 2010: Bounded Number of Squares in Infinite Repetition-Constrained Binary Words 2014: Closed Factorization 2019: k-Abelian Pattern Matching: Revisited, Corrected, and Extended 2020: Left Lyndon Tree Construction
Goran Žužić School of Computer Science Carnegie Mellon University 5000 Forbes Ave., Pittsburgh 15213, PA, USA	E-mail: gzuzicᏍcs.cmu.edu Papers on our conference 2018: Fast and Simple Algorithms for Computing both LCSk and LCSk+
Keisuke Goto Fujitsu Laboratories Ltd. Kawasaki Japan	E-mail: goto.keisukeᏍfujitsu.com Papers on our conference 2014: Closed Factorization 2019: Optimal Time and Space Construction of Suffix Arrays and LCP Arrays for Integer Alphabets 2020: Re-Pair in Small Space
Szymon Grabowski Institute of Applied Computer Science Łódź University of Technology Al. Politechniki 11, 90–924 Łódź Poland	E-mail: sgrabowᏍkis.p.lodz.pl Papers on our conference 2005: A Simple Alphabet-Independent FM-Index 2006: Efficient Algorithms for (δ, γ, α)-Matching 2006: FM-KZ: An Even Simpler Alphabet-Independent FM-Index 2010: Tight and Simple Web Graph Compression 2014: Multiple Pattern Matching Revisited 2014: Two Simple Full-Text Indexes Based on the Suffix Array 2014: New Tabulation and Sparse Dynamic Programming Based Techniques for Sequence Similarity Problems 2017: Faster Batched Range Minimum Queries
Richard Groult Universitté de Picardie Jules Verne 1, Chemin du Thil 80025 Amiens CEDEX 1 Université de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: Richard.GroultᏍuniv-rouen.fr Papers on our conference 2003: A Linear Algorithm for the Detection of Evolutive Tandem Repeats 2018: Three Strategies for the Dead-Zone String Matching Algorithm
Laurent Guéguen UMR 5558 CNRS Biométrie et Biologie Evolutive Université Claude Bernard Lyon 1 43, Bd. du 11 Novembre 1918 69622 Villeurbanne cedex France	Papers on our conference 2006: A Markovian Approach for the Analysis of the Gene Structure
Gustav Matula Faculty of Electrical Engineering and Computing Unska 3, 10000 Zagreb Croatia	E-mail: gustav.matulaᏍfer.hr Papers on our conference 2018: Fast and Simple Algorithms for Computing both LCSk and LCSk+
Ondřej Guth Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: ondrej.guthᏍfit.cvut.cz phone: Papers on our conference 2016: Computing All Approximate Enhanced Covers with the Hamming Distance 2021: Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance 2023: On Expressive Power of Regular Expressions with Subroutine Calls and Lookaround Assertions
Kazuhito Hagio Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: kazuhito.hagioᏍi.kyushu-u.ac.jp Papers on our conference 2011: Efficient Eager XPath Filtering over XML Streams
Thomas Hanneforth Department of Linguistics University of Potsdam Karl-Liebknecht-Strasse 24-25 14476 Potsdam	E-mail: Thomas.HanneforthᏍuni-posdam.de WWW: http://www.ling.uni-potsdam.de/~tom/ Papers on our conference 2012: An Efficient Parallel Determinisation Algorithm for Finite-state Automata
Danny Harnik IBM - Diligent IBM Israel HQ, Azorim Park 94 Em Hamoshavot Rd. Kiryat Arie, Petach Tiqva, 49527, Israel	E-mail: dannyhᏍil.ibm.com Papers on our conference 2012: Similarity Based Deduplication with Small Data Chunks
Kees Hemerik Department of Mathematics and Computer Science Technische Universiteit Eindhoven P.O. Box 513, NL-5600 MB Eindhoven The Netherlands	E-mail: c.hemerikᏍtue.nl Papers on our conference 2005: A Missing Link in Root-to-Frontier Tree Pattern Matching 2009: Taxonomies of Regular Tree Algorithms
Glen Herrmannsfeldt Department of Molecular Biotechnology University of Washington Box 357730 Seattle, WA 98195-7730 USA	E-mail: gahᏍmbt.washington.edu Papers on our conference 1998: A Highly Parallel Finite State Automaton Processor for Biological Pattern Matching
Yasuto Higa Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: y-higaᏍi.kyushu-u.ac.jp Papers on our conference 2006: Reachability on Suffix Tree Graphs
Fumihito Higashijima Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	Papers on our conference 2008: Parameterized Suffix Arrays for Binary Strings
Hilde Verbeek Centrum Wiskunde&Informatica, Amsterdam, The Netherlands	E-mail: hilde.verbeekᏍcwi.nl Papers on our conference 2023: Periodicity of Degenerate Strings
Kazunori Hirashima Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: kazunori.hirashimaᏍinf.kyushu-u.ac.jp Papers on our conference 2009: Bit-parallel algorithms for computing all the runs in a string
Sachio Hirokawa Computing and Communications Center Kyushu University 33 Hakozaki 6-10-1 Higashi-ku, Fukuoka 812-8581 Japan	E-mail: hirokawaᏍcc.kyushu-u.ac.jp Papers on our conference 2003: An Efficient Mapping for Score of String Matching
Tommi Hirvola Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: Tommi.HirvolaᏍaalto.fi Papers on our conference 2014: Improved Two-Way Bit-parallel Search
Václav Hlaváč Center for Machine Perception Department for Cybernetics Faculty of Electrical Eng. Czech Technical University in Prague Prague	E-mail: hlavacᏍfel.cvut.cz phone: +420 22435 7465 Papers on our conference 2006: 2D Context-Free Grammars: Mathematical Formulae Recognition
Guillaume Holley IRISA/INRIA Rennes Bretagne Atlantique Campus de Beaulieu 35042 Rennes Cedex France	E-mail: guillaumeholleyᏍgmail.com Papers on our conference 2012: BlastGraph: Intensive Approximate Pattern Matching in Sequence Graphs and de-Bruijn Graphs
Holly Koponen Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: koponehᏍmcmaster.ca Papers on our conference 2023: Improved Practical Algorithms to Compute Maximal Covers
Jan Holub Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Jan.HolubᏍfit.cvut.cz WWW: www.stringology.org/~holub/ phone: (+420) 224 357 814 Papers on our conference 1996: Reduced Nondeterministic Finite Automata for Approximate String Matching 1997: 6D Classification of Pattern Matching Problems 1997: Simulation of NFA in Approximate String and Sequence Matching 1998: Dynamic Programming for Reduced NFAs for Approximate String and Sequence Matching
Hiromasa Hoshino Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: hoshinoᏍi.kyushu-u.ac.jp WWW: www.i.kyushu-u.ac.jp/~hoshino/index_e.html Papers on our conference 2001: Construction of the CDAWG for a Trie
Heikki Hyyrö Department of Computer and Information Sciences University of Tampere Finland	E-mail: Heikki.HyyroᏍcs.uta.fi WWW: www.cs.uta.fi/~helmu/ Papers on our conference 2002: A Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances 2004: A Note on Bit-Parallel Alignment Computation 2005: Bit-Parallel Computation of Local Similarity Score Matrices with Unitary Weights 2009: An input sensitive online algorithm for LCS computation
Tomohiro I Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan Kyushu Institute of Technology Fukuoka, 804-8550 Japan	E-mail: tomohiro.iᏍinf.kyushu-u.ac.jp Papers on our conference 2011: Inferring Strings from Suffix Trees and Links on a Binary Alphabet 2013: Computing Reversed Lempel-Ziv Factorization Online 2014: Closed Factorization 2016: Dynamic Index and LZ Factorization in Compressed Space 2019: k-Abelian Pattern Matching: Revisited, Corrected, and Extended 2020: Re-Pair in Small Space
Igor O. Zavadskyi Taras Shevchenko National University of Kyiv 2d Glushkova ave., Kyiv, Ukraine	E-mail: ihorzaᏍgmail.com Papers on our conference 2016: A Family of Data Compression Codes with Multiple Delimiters 2017: A Family of Exact Pattern Matching Algorithms with Multiple Adjacent Search Windows 2020: Fast Exact Pattern Matching in a Bitstream and 256-ary Strings 2023: Efficient Integer Retrieval from Unordered Compressed Sequences
Daisuke Ikeda Computing and Communications Center Kyushu University 33 Hakozaki 6-10-1 Higashi-ku, Fukuoka 812-8581 Japan	E-mail: daisukeᏍcc.kyushu-u.ac.jp Papers on our conference 2003: An Efficient Mapping for Score of String Matching
Costas S. Iliopoulos Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: c.iliopoulosᏍkcl.ac.uk WWW: www.dcs.kcl.ac.uk/staff/csi/ Papers on our conference 1998: Validating and Decomposing Partially Occluded Two-Dimensional Images (Extended Abstract) 2000: Computing Approximate Repetitions in Musical Sequences 2001: Approximate String Matching in Musical Sequences 2002: String Matching with Gaps for Musical Melodic Recognition 2002: String Regularities with Don't Cares 2003: Approximate Seeds of Strings 2003: Computing the Minimum k-Cover of a String 2003: Computing the Repetitions in a Weighted Sequence 2004: A First Approach to Finding Common Motifs With Gaps 2005: Approximation Algorithm for the Cyclic Swap Problem 2006: Song Classifications for Dancing 2008: Conservative String Covering of Indeterminate Strings 2009: Validation and Decomposition of Partially Occluded Images with Holes 2009: Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies (updated Jan 2010) 2010: New Simple Efficient Algorithms Computing Powers and Runs in Strings 2012: New and Efficient Approaches to the Quasiperiodic Characterisation of a String 2013: Maximal Palindromic Factorization 2014: Closed Factorization
Ina Schaefer Software Engineering, TU Braunschweig, Germany	E-mail: i.schaeferᏍtu-bs.de Papers on our conference 2017: Many-MADFAct: Concurrently Constructing MADFAs
Shunsuke Inenaga Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan PRESTO, Japan Science and Technology Agency, Kawaguchi, Japan	E-mail: inenagaᏍinf.kyushu-u.ac.jp WWW: str.i.kyushu-u.ac.jp/~inenaga/ Papers on our conference 2001: Construction of the CDAWG for a Trie 2002: A Note on Randomized Algorithm for String Matching with Mismatches 2002: Bidirectional Construction of Suffix Trees 2004: A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems 2006: Sparse Compact Directed Acyclic Word Graphs 2006: Reachability on Suffix Tree Graphs 2008: Parameterized Suffix Arrays for Binary Strings 2009: Finding Characteristic Substrings from Compressed Texts 2011: Inferring Strings from Suffix Trees and Links on a Binary Alphabet 2011: Computing Longest Common Substring/Subsequence of Non-linear Texts 2013: Computing Reversed Lempel-Ziv Factorization Online 2014: Computing Abelian Covers and Abelian Runs 2014: Closed Factorization 2015: A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications 2015: Computing Left-Right Maximal Generic Words 2016: Computing Smallest and Largest Repetition Factorizations in O(n log n) Time 2016: Dynamic Index and LZ Factorization in Compressed Space 2017: On Reverse Engineering the Lyndon Tree 2018: O(n log n)-time Text Compression by LZ-style Longest First Substitution 2018: Right-to-left Online Construction of Parameterized Position Heaps 2019: Computing Maximal Palindromes and Distinct Palindromes in a Trie 2019: k-Abelian Pattern Matching: Revisited, Corrected, and Extended 2020: Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings 2021: Counting Lyndon Subsequences 2023: Computing SEQ-IC-LCS of Labeled Graphs
Hiroe Inoue Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: hiroe.inoueᏍinf.kyushu-u.ac.jp Papers on our conference 2016: Computing Smallest and Largest Repetition Factorizations in O(n log n) Time
Isamu Furuya Hokkaido University Graduate School of Information Science and Technology Kita 14, Nishi 9 Kita-ku, Sapporo	E-mail: furuyaᏍist.hokudai.ac.jp Papers on our conference 2020: Re-Pair in Small Space
Ariel Ish-Shalom IBM - Diligent IBM Israel HQ, Azorim Park 94 Em Hamoshavot Rd. Kiryat Arie, Petach Tiqva, 49527, Israel	E-mail: arielishᏍil.ibm.com Papers on our conference 2013: Optimal Partitioning of Data Chunks in Deduplication Systems
Akira Ishino Google Japan Inc.	E-mail: ishinoᏍgoogle.com Papers on our conference 2008: New Lower Bounds for the Maximum Number of Runs in a String 2008: Average Value of Sum of Exponents of Runs in Strings 2009: Bit-parallel algorithms for computing all the runs in a string 2010: Inferring Strings from Runs
A. S. M. Sohidul Islam School of Computational Science & Engineering McMaster University Hamilton, Ontario Canada L8S 4K1	E-mail: sohansayedᏍgmail.com Papers on our conference 2016: Algorithms to Compute the Lyndon Array
Ivan Katanić Faculty of Electrical Engineering and Computing Unska 3, 10000 Zagreb Croatia	E-mail: ivan.katanicᏍfer.hr Papers on our conference 2018: Fast and Simple Algorithms for Computing both LCSk and LCSk+
Kimihiro Iwasaki Department of Information Science and Intelligent Systems University of Tokushima 2-1 Minami-Josanjima-Cho Tokushima-Shi 770-8506 Japan	Papers on our conference 1998: A Fast Morphological Analysis Using the Extended AC Machine for Oriental Languages
Jakub Radoszewski Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland	E-mail: jradᏍmimuw.edu.pl Papers on our conference 2019: Pattern Matching on Weighted Strings
Jan Janoušek Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Jan.JanousekᏍfit.cvut.cz WWW: users.fit.cvut.cz/~janousej/ phone: (+420) 224 359 872 Papers on our conference 2009: String Suffix Automata and Subtree Pushdown Automata 2018: Constrained Approximate Subtree Matching by Finite Automata 2020: Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination 2020: Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array 2021: Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance
Inuka Jayasekera Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: inuka.jayasekeraᏍkcl.ac.uk WWW: www.dcs.kcl.ac.uk/pg/jayasek/ Papers on our conference 2008: Conservative String Covering of Indeterminate Strings
Yue Jiang Lane Department of Computer Science and Electrical Engineering West Virginia University Morgantown, WV 26506 USA	E-mail: yueᏍcsee.wvu.edu Papers on our conference 2008: The Virtual Suffix Tree: An Efficient Data Structure for Suffix Trees 2009: Crochemore's repetitions algorithm revisited–computing runs
Mei Jiang Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: jiangm5Ꮝmcmaster.ca Papers on our conference 2011: An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning Algorithm 2012: A Computational Framework for Determining Square-maximal Strings
Johannes Fischer Department of Computer Science Technische Universität Dortmund Germany	E-mail: johannes.fischerᏍcs.tu-dortmund.de Papers on our conference 2017: Dismantling DivSufSort
Jean-Michel Jolion	E-mail: jean-michel.jolionᏍliris.cnrs.fr Papers on our conference 2008: On the Uniform Distribution of Strings
Jorma Tarhio Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: jorma.tarhioᏍaalto.fi Papers on our conference 2011: Variations of Forward-SBNDM 2014: Improved Two-Way Bit-parallel Search 2014: Speeding up Compressed Matching with SBNDM2 2014: Alternative Algorithms for Lyndon Factorization 2015: Alternative Algorithms for Order-Preserving Matching 2015: Tuning Algorithms for Jumbled Matching 2016: Jumbled Matching with SIMD 2017: Counting Mismatches with SIMD 2020: Tune-up for the Dead-Zone Algorithm 2021: Pitfalls of Algorithm Comparison 2021: Searching with Extended Guard and Pivot Loop 2023: Approximate String Searching with AVX2 and AVX-512
Winfried Just Department of Mathematics Ohio University Athens Ohio 45701 U.S.A.	E-mail: justᏍmath.ohiou.edu Papers on our conference 2000: Multiple Sequence Alignment as a Facility Location Problem
Vojtěch Kačírek Dept. of Comp. Sci. & Eng. Faculty of Electrical Eng. Czech Technical University in Prague Prague
Kalle Karhu Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: kalle.karhuᏍaalto.fi Papers on our conference 2011: Improving Exact Search of Multiple Patterns From a Compressed Suffix Array
Juha Kärkkäinen Department of Computer Science University of Helsinki PO Box 68, FI--00014, Finland	E-mail: Juha.KarkkainenᏍcs.helsinki.fi Papers on our conference 2004: BDD-Based Analysis of Gapped q-Gram Filters 2005: Alphabets in Generic Programming 2013: Crochemore's String Matching Algorithm: Simplification, Extensions, Applications
Yair Kaufman Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel	E-mail: kaufmayᏍcs.biu.ac.il Papers on our conference 2004: Semi-Lossless Text Compression
S. Keller Department of Computer Science Liverpool John Moores University Byrom Street Liverpool United Kingdom	E-mail: S.KellerᏍlivjm.ac.uk Papers on our conference 2001: Searching in an Efficiently Stored DNA Text Using a Hardware Solution
Dominik Kempa Department of Computer Science University of Helsinki PO Box 68, FI--00014, Finland	E-mail: Dominik.KempaᏍcs.helsinki.fi Papers on our conference 2013: Crochemore's String Matching Algorithm: Simplification, Extensions, Applications
Kensuke Sakai Kyushu Institute of Technology Fukuoka, 804-8550 Japan	E-mail: k_sakaiᏍdonald.ai.kyutech.ac.jp Papers on our conference 2020: Re-Pair in Small Space
Kfir Cohen Department of Computer Science and Mathematics Ariel University Ariel 40700 Israel	E-mail: kfirco12Ꮝgmail.com Papers on our conference 2023: Turning Compression Schemes into Crypto-Systems
A. Khorsi CSD University of Djilali Liabes Sidi-Bel-Abbes Algeria	E-mail: ahmed_khorsiᏍlycos.com Papers on our conference 2002: Split and join for minimizing: Brzozowski's algorithm
Tomasz Kociumaka Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland	E-mail: kociumakaᏍmimuw.edu.pl Papers on our conference 2012: New and Efficient Approaches to the Quasiperiodic Characterisation of a String
Josef Kolář Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Josef.KolarᏍfit.cvut.cz phone: (+420) 224 359 872
Stavros Konstantinidis Department of Mathematics and Computing Science Saint Mary's University 923 Robie Street Halifax, Nova Scotia Canada B3H 3C3	E-mail: s.konstantinidisᏍsmu.ca WWW: http://cs.smu.ca/~stavros/ Papers on our conference 2013: Deciding the Density Type of a Given Regular Language
Dmitry Kosolobov Institute of Mathematics and Computer Sciences Ural Federal University named after First President of Russia B.N. Yeltsin 620002, Ekaterinburg, ul. Mira, 19	E-mail: dkosolobovᏍmail.ru Papers on our conference 2013: Finding Distinct Subpalindromes Online
Derrick G. Kourie FASTAR Finite Automata Systems – Theoretical and Applied Research group Department of Computer Science, University of Pretoria Pretoria 0002 Republic of South Africa Department of Mathematical Sciences, Computer Science Division, Stellenbosch University, Private Bag X1, 7602 Matieland, South Africa Centre for Artificial Intelligence Research Meiring Naude Road Pretoria South Africa	E-mail: dkourieᏍcs.up.ac.za Papers on our conference 2004: A Framework for the Dynamic Implementation of Finite Automata for Performance Enhancement 2005: Reordering Finite Automata States for Fast String Recognition 2006: A Concurrent Specification of Brzozowski's DFA Construction Algorithm 2006: Efficient Automata Constructions and Approximate Automata 2006: On Implementation and Performance of Table-Driven DFA-Based String Processors 2006: FireμSat: An Algorithm to Detect Microsatellites in DNA 2008: A Concurrent Specification of an Incremental DFA Minimisation Algorithm 2008: On Regular Expression Hashing to Reduce FA Size 2009: On Minimizing Deterministic Tree Automata 2010: Improving Automata Efficiency by Stretching and Jamming 2010: Formal Characterizations of FA-based String Processors 2012: Failure Deterministic Finite Automata 2013: Weak Factor Automata: Comparing (Failure) Oracles and Storacles 2014: A Process-Oriented Implementation of Brzozowski's DFA Construction Algorithm 2014: Using Correctness-by-Construction to Derive Dead-zone Algorithms 2015: Quantum Leap Pattern Matching
Justin Kourie Department of Computer Science, University of Pretoria Pretoria 0002 Republic of South Africa	E-mail: justinᏍfastar.org Papers on our conference 2011: On Compile Time Knuth-Morris-Pratt Precomputation
Tomáš Koutný Computer Science Department Palacky University of Olomouc Tomkova 40 779 00 Olomouc Czech Republic	E-mail: Tomas.KoutnyᏍupol.cz Papers on our conference 1997: Algebra of Pattern Matching Problems
Tomasz Kowalski Institute of Applied Computer Science Łódź University of Technology Al. Politechniki 11, 90–924 Łódź Poland	E-mail: tkowalsᏍkis.p.lodz.pl Papers on our conference 2017: Faster Batched Range Minimum Queries
Michal Krátký Department of Computer Science Faculty of Electrical Engineering and Informatics VSB-Technical University Ostrava 17. listopadu 15 708 33 Ostrava Czech Republic	E-mail: michal.kratkyᏍvsb.cz WWW: www.cs.vsb.cz/kratky/ Papers on our conference 2002: Image Recognition Using Finite Automata
Marcin Kubica Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland	E-mail: kubicaᏍmimuw.edu.pl Papers on our conference 2010: New Simple Efficient Algorithms Computing Powers and Runs in Strings
Manfred Kufleitner FMI, Universität Stuttgart Universitätsstraße 38, 70569 Stuttgart, Germany	E-mail: kufleitnerᏍfmi.uni-stuttgart.de Papers on our conference 2009: On Bijective Variants of the Burrows-Wheeler Transform
M. Oğuzhan Külekci Informatics Institute Istanbul Technical University, Istanbul, Turkey	E-mail: kulekciᏍitu.edu.tr Papers on our conference 2009: Filter Based Fast Matching of Long Patterns by Using SIMD Instructions 2013: Towards a Very Fast Multiple String Matching Algorithm for Short Patterns 2015: An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem 2015: Alternative Algorithms for Order-Preserving Matching 2020: Enumerative Data Compression with Non-Uniquely Decodable Codes
Ryutaro Kurai Hokkaido University Graduate School of Information Science and Technology Kita 14, Nishi 9 Kita-ku, Sapporo Hokkaido University ERATO MINATO Discrete Structure Manipulation System Project	E-mail: kuraiᏍerato.ist.hokudai.ac.jp Papers on our conference 2014: Fast Regular Expression Matching Based On Dual Glushkov NFA
Masahiro Kurokawa Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: kurokawaᏍdcs.kcl.ac.uk Papers on our conference 2002: String Matching with Gaps for Musical Melodic Recognition
Kazuhiko Kusano Graduate School of Information Science Tohoku University Aramaki aza Aoba 6-6-05, Aoba-ku Sendai 980-8579 Japan	E-mail: kusanoᏍshino.ecei.tohoku.ac.jp WWW: http://www.shino.ecei.tohoku.ac.jp/~kusano/ Papers on our conference 2008: New Lower Bounds for the Maximum Number of Runs in a String 2008: Average Value of Sum of Exponents of Runs in Strings 2010: Average Number of Runs and Squares in Necklace 2010: The Number of Runs in a Ternary Word 2013: On Morphisms Generating Run-Rich Strings
Jan Lahoda Oracle U Trezorky 921/2 158 00 Praha 5	E-mail: Jan.LahodaᏍseznam.cz Papers on our conference 2005: General Pattern Matching on Regular Collage System 2010: Simple Tree Pattern Matching for Trees in the Prefix Bar Notation
Giuseppe Lancia Dipartimento di Matematica e Informatica Via delle Scienze 206 33100 Udine Italy	E-mail: lanciaᏍdimi.uniud.it Papers on our conference 2006: Flipping Letters to Minimize the Support of a String 2010: Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms
Gad M. Landau Department of Computer Science Faculty of Social Sciences University of Haifa Mount Carmel, 31905 Haifa Israel	E-mail: landauᏍcs.haifa.ac.il Papers on our conference 2005: Approximation Algorithm for the Cyclic Swap Problem 2006: Can Dist Tables Be Merged in Linear Time – An Open Problem 2008: Conservative String Covering of Indeterminate Strings
Uli Laube Institut für Informatik Johann Wolfgang Goethe-Universität Frankfurt am Main Robert-Mayer-Straβe 11-15 60054 Frankfurt am Main Germany	E-mail: laubeᏍthi.cs.uni-frankfurt.de Papers on our conference 2004: Conditional Inequalities and the Shortest Common Superstring Problem
Thierry Lecroq LITIS EA 4108 Université de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: thierry.lecroqᏍuniv-rouen.fr WWW: monge.univ-mlv.fr/~lecroq/ Papers on our conference 1998: Exact String Matching Animation in Java 2000: Computing Approximate Repetitions in Musical Sequences 2001: Approximate String Matching in Musical Sequences 2002: Border Array on Bounded Alphabet 2005: From Suffix Trees to Suffix Vectors 2008: Dynamic Burrows-Wheeler Transform 2008: Efficient Variants of the Backward-Oracle-Matching Algorithm 2011: 2001–2010: Ten Years of Exact String Matching Algorithms 2011: Computing Abelian Periods in Words 2012: Quasi-linear Time Computation of the Abelian Periods of a Word 2016: The String Matching Algorithms Research Tool 2018: Three Strategies for the Dead-Zone String Matching Algorithm 2020: Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings
Arnaud Lefebvre UMR 6037 - ABISS Universite de Rouen 76821 Mont Saint Aignan Cedex France LITIS EA 4108 Université de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: Arnaud.LefebvreᏍuniv-rouen.fr Papers on our conference 2002: Border Array on Bounded Alphabet 2011: Computing Abelian Periods in Words 2012: Quasi-linear Time Computation of the Abelian Periods of a Word 2018: Three Strategies for the Dead-Zone String Matching Algorithm
Martine Léonard Université de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: Martine.LeonardᏍuniv-rouen.fr Papers on our conference 2003: A Linear Algorithm for the Detection of Evolutive Tandem Repeats 2008: Dynamic Burrows-Wheeler Transform 2018: Three Strategies for the Dead-Zone String Matching Algorithm
Arthur M. Lesk Department of Hematology University of Cambridge Clinical School MRC Centre Hills Road Cambridge CB2 2QH United Kingdom	E-mail: aml2Ꮝmrc-lmb.cam.ac.uk Papers on our conference 1998: Application of Sequence Alignment Methods to Multiple Structural Alignment and Superposition
Peter Leupold Institut für Informatik Universität Leipzig> Leipzig Germany	E-mail: Peter.LeupoldᏍweb.jp Papers on our conference 2009: Reducing Repetitions 2014: Reducing Squares in Suffix Arrays
F. Liberati Computer Science Department Università di Roma "La Sapienza" Via Salaria 113 00198 Rome Italy	Papers on our conference 2004: A Simple Lossless Compression Heuristic for Grey Scale Images
Antoine Limasset IRISA/INRIA Rennes Bretagne Atlantique Campus de Beaulieu 35042 Rennes Cedex France	Papers on our conference 2016: A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics
Jie Lin Lane Department of Computer Science and Electrical Engineering West Virginia University Morgantown, WV 26506 USA	E-mail: jlinᏍmix.wvu.edu Papers on our conference 2008: The Virtual Suffix Tree: An Efficient Data Structure for Suffix Trees
Zsuzsanna Lipták AG Genominformatik Technische Fakultät Bielefeld Universität Germany	E-mail: zsuzsaᏍcebitec.uni-bielefeld.de Papers on our conference 2009: Searching for Jumbled Patterns in Strings
Luca Lombardi Computer Science Department University of Pavia Via Ferrara 1 27100 Pavia Italy	E-mail: luca.lombardiᏍunipv.it Papers on our conference 2008: Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine 2010: Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and Scalability 2011: Binary Image Compression via Monochromatic Pattern Substitution: A Sequential Speed-Up
Weilin Lu Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	Papers on our conference 2000: Repetitions in two-pattern strings
Alessandro Maggio Università di Catania Viale Andrea Doria 6 95125 Catania Italy	Papers on our conference 2016: The String Matching Algorithms Research Tool
Veli Makinen Technische Fakultät Bielefeld Universität Germany	E-mail: veliᏍcebitec.uni-bielefeld.de WWW: www.cs.helsinki.fi/u/vmakinen/ phone: +358 9 191 44119 Papers on our conference 2003: Matching Numeric Strings under Noise 2005: Flexible Music Retrieval in Sublinear Time 2005: A Simple Alphabet-Independent FM-Index
Alban Mancheron L.I.N.A, Université de Nantes, 2, Rue de la Houssinière, B.P. 92208 44322 Nantes Cedex 3 France	E-mail: MancheronᏍlina-univ-nantes.fr Papers on our conference 2004: Combinatorial Characterization of the Language Recognized by Factor and Suffix Oracles
Sabrina Mantaci Dipartimento di Matematica e Applicazioni, Università di Palermo, Palermo, Italy	E-mail: sabrinaᏍmath.unipa.it Papers on our conference 2013: Sorting Suffixes of a Text via its Lyndon Factorization
Camille Marchet IRISA/INRIA Rennes Bretagne Atlantique Campus de Beaulieu 35042 Rennes Cedex France	Papers on our conference 2016: A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics
Markus Mauer Institute of Theoretical Computer Science Ulm University 89069 Ulm Germany	E-mail: Markus.MauerᏍuni-ulm.de Papers on our conference 2017: A Lempel-Ziv-style Compression Method for Repetitive Texts
Marni Mishna Department of Mathematics Simon Fraser University 8888 University Drive, Burnaby, BC, V5A 1S6 Canada	E-mail: Papers on our conference 2021: Refined Upper Bounds on the Size of the Condensed Neighbourhood of Sequences
Martin Plátek Faculty of Mathematics and Physics Charles University Czech Republic	Papers on our conference 2019: Lexicalized Syntactic Analysis by Restarting Automata
Wataru Matsubara Graduate School of Information Science Tohoku University Aramaki aza Aoba 6-6-05, Aoba-ku Sendai 980-8579 Japan	E-mail: shohei.matsubaraᏍshino.ecei.tohoku.ac.jp Papers on our conference 2008: New Lower Bounds for the Maximum Number of Runs in a String 2008: Average Value of Sum of Exponents of Runs in Strings 2009: Bit-parallel algorithms for computing all the runs in a string 2010: Inferring Strings from Runs 2010: The Number of Runs in a Ternary Word
Shohei Matsuda Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: shoheiᏍinf.kyushu-u.ac.jp Papers on our conference 2014: Computing Abelian Covers and Abelian Runs
Yoshiaki Matsuoka Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	Papers on our conference 2016: Computing Smallest and Largest Repetition Factorizations in O(n log n) Time
Petr Matyáš Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: matyape1Ꮝfit.cvut.cz phone:
James McHugh New Jersey Institute of Technology College of Computing Sciences 323 M.L.King Blvd. University Heights Newark NJ 07102-1982, USA	E-mail: mchughᏍoak.njit.edu WWW: www.cs.njit.edu/~mchugh Papers on our conference 2004: A First Approach to Finding Common Motifs With Gaps
Moti Meir Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel	E-mail: moti.meirᏍgmail.com Papers on our conference 2009: Delta Encoding in a Compressed Domain
Bořivoj Melichar Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: melicharᏍfit.cvut.cz phone: (+420) 224 357 287, (+420) 224 359 872 Papers on our conference 1996: Space Complexity of Linear Time Approximate String Matching 1997: 6D Classification of Pattern Matching Problems 1998: Directed Acyclic Subsequence Graph 2003: Operation L-INSERT on Factor Automaton 2004: Arithmetic Coding in Parallel 2005: General Pattern Matching on Regular Collage System 2005: Backward Pattern Matching Automaton 2006: 2D Bitwise Memory Matrix: A Tool for Optimal Parallel Approximate Pattern Matching 2013: Graphs and Automata 2018: Constrained Approximate Subtree Matching by Finite Automata
Christelle Melo de Lima UMR 5558 CNRS Biométrie et Biologie Evolutive Université Claude Bernard Lyon 1 43, Bd. du 11 Novembre 1918 69622 Villeurbanne cedex France	E-mail: meloᏍbiomserv.univ-lyon1.fr phone: +04 72 44 81 42 Papers on our conference 2006: A Markovian Approach for the Analysis of the Gene Structure
Juan Mendivelso Fundacion Universitaria Konrad Lorenz Bogota Colombia	E-mail: juanc.mendivelsomᏍkonradlorenz.edu.co Papers on our conference 2012: A Multiobjective Approach to the Weighted Longest Common Subsequence Problem 2015: Parameterized Matching: Solutions and Extensions
Michael Hirsch Toga Networks, a Huawei Company 4 Ha'Harash St Hod Hasharon Israel	E-mail: michael.hirschᏍtoganetworks.com Papers on our conference 2011: Improving Deduplication Techniques by Accelerating Remainder Calculations 2012: Similarity Based Deduplication with Small Data Chunks 2013: Optimal Partitioning of Data Chunks in Deduplication Systems 2015: Controlling the Chunk-Size in Deduplication Systems 2019: A Fast SIMD-Based Chunking Algorithm
Michael Liut Department of Mathematical and Computational Sciences University of Toronto Mississauga Canada	E-mail: michael.liutᏍutoronto.ca Papers on our conference 2018: On Baier's Sort of Maximal Lyndon Substrings 2019: Algorithms to Compute the Lyndon Array Revisited 2021: Computational Substantiation of the d-step Conjecture for Distinct Squares Revisited
Michelle Sweering Centrum Wiskunde&Informatica, Amsterdam, The Netherlands	E-mail: michelle.sweeringᏍcwi.nl Papers on our conference 2023: Periodicity of Degenerate Strings
Łukasz Mikulski Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: lukasz.mikulskiᏍmat.umk.pl Papers on our conference 2011: Algorithmics of Posets Generated by Words over Partially Commutative Alphabets 2016: Generating All Minimal Petri Net Unsolvable Binary Words
Mile Šikić Faculty of Electrical Engineering and Computing Unska 3, 10000 Zagreb Croatia	E-mail: mile.sikicᏍfer.hr Papers on our conference 2017: Trade-offs in Query and Target Indexing for the Selection of Candidates in Protein Homology Searches 2018: Fast and Simple Algorithms for Computing both LCSk and LCSk+
Mirka Miller Department of Computer Science King's College London Strand, London WC2R 2LS England School of Electrical Engineering and Computer Science The University of Newcastle Callaghan NSW 2308, Australia Digital Ecosystems & Business Intelligence Institute, Curtin University, GPO Box U1987 Perth WA 6845, Australia	E-mail: mirka.millerᏍnewcastle.edu.au Papers on our conference 2009: Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies (updated Jan 2010)
Shin-ichi Minato Hokkaido University Graduate School of Information Science and Technology Kita 14, Nishi 9 Kita-ku, Sapporo Hokkaido University ERATO MINATO Discrete Structure Manipulation System Project	E-mail: minatoᏍist.hokudai.ac.jp WWW: http://www-alg.ist.hokudai.ac.jp/~minato/index.html Papers on our conference 2011: Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations 2013: Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams 2014: Fast Regular Expression Matching Based On Dual Glushkov NFA
Mitsuru Funakoshi Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: mitsuru.funakoshiᏍinf.kyushu-u.ac.jp Papers on our conference 2019: Computing Maximal Palindromes and Distinct Palindromes in a Trie
Christophe Moan L.I.N.A, Université de Nantes, 2, Rue de la Houssinière, B.P. 92208 44322 Nantes Cedex 3 France	E-mail: MoanᏍlina-univ-nantes.fr Papers on our conference 2004: Combinatorial Characterization of the Language Recognized by Factor and Suffix Oracles
Manal Mohamed Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: manalᏍdcs.kcl.ac.uk phone: +44 20 7848 2475 Papers on our conference 2002: String Regularities with Don't Cares 2003: Computing the Minimum k-Cover of a String 2005: Approximation Algorithm for the Cyclic Swap Problem 2009: Validation and Decomposition of Partially Occluded Images with Holes
Laurent Mouchard LITIS EA 4108 Université de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: Laurent.MouchardᏍuniv-rouen.fr WWW: www.dir.univ-rouen.fr/~lm Papers on our conference 2000: Computing Approximate Repetitions in Musical Sequences 2002: String Regularities with Don't Cares 2003: A Linear Algorithm for the Detection of Evolutive Tandem Repeats 2003: Computing the Repetitions in a Weighted Sequence 2008: Dynamic Burrows-Wheeler Transform 2018: Three Strategies for the Dead-Zone String Matching Algorithm
Mwawi Msiska Department of Mathematical Sciences, Computer Science Division, Stellenbosch University, Private Bag X1, 7602 Matieland, South Africa	E-mail: mfmsiskaᏍgmail.com Papers on our conference 2016: Interpreting the Subset Construction Using Finite Sublanguages
Pavel Mužátko Dept. of Comp. Sci. & Eng. Faculty of Electrical Eng. Czech Technical University in Prague Prague	Papers on our conference 1996: Approximate Regular Expression Matching
Shinobu Nagayama Hiroshima City University Department of Computer and Network Engineering Kita 14, Nishi 9 Kita-ku, Sapporo	E-mail: s_nagaᏍhiroshima-cu.ac.jp Papers on our conference 2014: Fast Regular Expression Matching Based On Dual Glushkov NFA
Yuto Nakashima Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: yuto.nakashimaᏍinf.kyushu-u.ac.jp Papers on our conference 2015: Computing Left-Right Maximal Generic Words 2016: Computing Smallest and Largest Repetition Factorizations in O(n log n) Time 2017: On Reverse Engineering the Lyndon Tree 2018: O(n log n)-time Text Compression by LZ-style Longest First Substitution 2018: Right-to-left Online Construction of Parameterized Position Heaps 2019: Computing Maximal Palindromes and Distinct Palindromes in a Trie 2021: Counting Lyndon Subsequences 2023: Computing SEQ-IC-LCS of Labeled Graphs
Tetsuya Nakatoh Computing and Communications Center Kyushu University 33 Hakozaki 6-10-1 Higashi-ku, Fukuoka 812-8581 Japan	E-mail: nakatohᏍcc.kyushu-u.ac.jp Papers on our conference 2003: An Efficient Mapping for Score of String Matching
Kazuyuki Narisawa Graduate School of Information Science Tohoku University Aramaki aza Aoba 6-6-05, Aoba-ku Sendai 980-8579 Japan	E-mail: narisawaᏍecei.tohoku.ac.jp WWW: http://www.shino.ecei.tohoku.ac.jp/member/narisawa/ Papers on our conference 2013: On Morphisms Generating Run-Rich Strings
Gonzalo Navarro Department of Computer Science University of Chile Blanco Encalada 2120 Santiago Chile	E-mail: gnavarroᏍdcc.uchile.cl WWW: www.dcc.uchile.cl/~gnavarro/eindex.html phone: 56-2-689-2736 Papers on our conference 2003: Matching Numeric Strings under Noise 2005: Flexible Music Retrieval in Sublinear Time 2005: A Simple Alphabet-Independent FM-Index 2005: Bit-Parallel Computation of Local Similarity Score Matrices with Unitary Weights 2006: FM-KZ: An Even Simpler Alphabet-Independent FM-Index 2009: Combining Text Compression and String Matching: The Miracle of Self-Indexing
Mhaskar Neerja Department of Computing&Software Faculty of Engineering McMaster University Hamilton, Ontario Canada L8S 4K1	E-mail: pophlinᏍmcmaster.ca Papers on our conference 2023: Improved Practical Algorithms to Compute Maximal Covers
Ernest Ketcha Ngassam SAP Meraka UTD, Pretoria, South Africa	E-mail: ernest.ngassamᏍsap.com Papers on our conference 2004: A Framework for the Dynamic Implementation of Finite Automata for Performance Enhancement 2005: Reordering Finite Automata States for Fast String Recognition 2006: Efficient Automata Constructions and Approximate Automata 2006: On Implementation and Performance of Table-Driven DFA-Based String Processors 2010: Formal Characterizations of FA-based String Processors
Akihiro Nishi Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: akihiro.nishiᏍinf.kyushu-u.ac.jp Papers on our conference 2018: O(n log n)-time Text Compression by LZ-style Longest First Substitution
Takaaki Nishimoto Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: takaaki.nishimotoaᏍinf.kyushu-u.ac.jp Papers on our conference 2015: Computing Left-Right Maximal Generic Words 2016: Dynamic Index and LZ Factorization in Compressed Space
Noriki Fujisato Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: noriki.fujisatoᏍinf.kyushu-u.ac.jp Papers on our conference 2018: Right-to-left Online Construction of Parameterized Position Heaps
Takashi Ohgami Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: takashi.oogamiᏍi.kyushu-u.ac.jp Papers on our conference 2011: Efficient Eager XPath Filtering over XML Streams
Makoto Okada Department of Information Science and Intelligent Systems University of Tokushima 2-1 Minami-Josanjima-Cho Tokushima-Shi 770-8506 Japan	Papers on our conference 1997: An Efficient Trie Hashing Method Using a Compact Binary Trie
Elina Opalinsky Department of Computer Science and Mathematics Ariel University Ariel 40700 Israel	E-mail: elina.opalinskᏍariel.ac.il Papers on our conference 2018: Synchronizing Dynamic Huffman Codes 2019: Selective Dynamic Compression 2023: Selective Weighted Adaptive Coding
Jan Pačes Institute of Molecular Genetics Academy of Science of the Czech Republic Flemingovo 2 166 37 Praha 6 Czech Republic	E-mail: hpacesᏍimg.cas.cz Papers on our conference 2001: Bioinformatics: tools for analysis of biological sequences
Geneviève Paquin Laboratoire de Combinatoire et d'Informatique Mathèmatique Universitè du Quèbec à Montrèal CP 8888, Succ. Centre-ville Montrèal H3C3P8 Canada	E-mail: genevieve.paquinᏍgmail.com Papers on our conference 2008: Infinite Smooth Lyndon Words
Asma Paracha Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: parachamᏍmcmaster.ca Papers on our conference 2017: The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array
T. Paranthoën Université de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: paranthoenᏍdir.univ-rouen.fr Papers on our conference 2002: Split and join for minimizing: Brzozowski's algorithm
Kunsoo Park School of Computer Science and Engineering Seoul National University Korea	E-mail: kparkᏍtheory.snu.ac.kr Papers on our conference 2003: Approximate Seeds of Strings 2020: Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings
Patrick Dinklage Chair of Algorithm Engineering Technische Universität Dortmund Otto Hahn Straße 14 Germany	E-mail: patrick.dinklageᏍtu-dortmund.de Papers on our conference 2019: Translating Between Wavelet Tree and Wavelet Matrix Construction
Arianna Pavone Dipartimento di Scienze Cognitive Università di Messina via Concezione n.6 98122, Messina, Italia	E-mail: apavoneᏍunime.it Papers on our conference 2015: Refined Tagging of Complex Verbal Phrases for the Italian Language 2017: Speeding Up String Matching by Weak Factor Recognition 2021: Towards an Efficient Text Sampling Approach for Exact and Approximate Matching
Hannu Peltola Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: hpeltolaᏍcs.hut.fi Papers on our conference 2011: Variations of Forward-SBNDM 2014: Improved Two-Way Bit-parallel Search 2021: Pitfalls of Algorithm Comparison
Pengfei Wang Laboratoire Informatique Robotique Microelectonique Montpellier L.I.R.M.M. Universite Montpellier II CNRS U.M.R. 5506 161 rue Ada, F--34392 Montpellier Cedex 5 France	E-mail: pengfei.wangᏍlirmm.fr Papers on our conference 2023: Periodicity of Degenerate Strings
Katerina G. Perdikuri Dept. of Computer Engineering and Informatics Computer Technology Institute University of Patras Patras Greece	E-mail: perdikurᏍceid.upatras.gr Papers on our conference 2002: String Regularities with Don't Cares 2003: Computing the Repetitions in a Weighted Sequence
Peter Damaschke Department of Computer Science and Engineering Chalmers University 41296 Göteborg, Sweden	E-mail: ptrᏍchalmers.se Papers on our conference 2023: Tandem Duplication Parameterized by the Length Difference
Pierre Peterlongo IRISA/INRIA Rennes Bretagne Atlantique Campus de Beaulieu 35042 Rennes Cedex France	E-mail: pierre.peterlongoᏍirisa.fr Papers on our conference 2004: A First Approach to Finding Common Motifs With Gaps 2006: The Gapped-Factor Tree 2008: In-place Update of Suffix Array while Recoding Words 2011: Finding Long and Multiple Repeats with Edit Distance 2012: BlastGraph: Intensive Approximate Pattern Matching in Sequence Graphs and de-Bruijn Graphs 2016: A Resource-frugal Probabilistic Dictionary and Applications in (Meta)Genomics
Marcin Piątkowski Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: martin.piatowskiᏍmat.umk.pl Papers on our conference 2008: Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words 2009: Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words 2011: Computing the Number of Cubic Runs in Standard Sturmian Words 2011: Algorithmics of Posets Generated by Words over Partially Commutative Alphabets 2012: The Number of Cubes in Sturmian Words 2013: The Sum of Exponents of Maximal Repetitions in Standard Sturmian Words 2016: Generating All Minimal Petri Net Unsolvable Binary Words
Didier Piau Institut Camille Jordan UMR 5208 Université Claude Bernard Lyon 1 43, Bd. du 11 Novembre 1918 69622 Villeurbanne cedex France	Papers on our conference 2006: A Markovian Approach for the Analysis of the Gene Structure
Marcelo da Silva Pinho Center for Telecommunications Studies (CETUC) Catholic University of Rio de Janeiro Marqus de S. Vincente, 255 22453-900 RIO DE JANEIRO, RJ Brazil	Papers on our conference 1999: On Procedures for Multiple-string Match with Respect to Two Sets
Yoan Pinzón Department of System Engineering and Industrial Engineering National University of Colombia Colombia	E-mail: ypinzonᏍunal.edu.co WWW: dis.unal.edu.co/profesores/ypinzon/index-eng.html Papers on our conference 2000: Computing Approximate Repetitions in Musical Sequences 2001: Approximate String Matching in Musical Sequences 2005: Approximation Algorithm for the Cyclic Swap Problem 2012: A Multiobjective Approach to the Weighted Longest Common Subsequence Problem 2015: Efficient Algorithm for δ-Approximate Jumbled Pattern Matching 2015: Parameterized Matching: Solutions and Extensions
Nadia Pisanti Department of Computer Science University of Pisa Italy	E-mail: pisantiᏍdi.unipi.it WWW: www.di.unipi.it/~pisanti Papers on our conference 2004: A First Approach to Finding Common Motifs With Gaps 2011: Finding Long and Multiple Repeats with Edit Distance
Solon P. Pissis Department of Computer Science King's College London Strand, London WC2R 2LS England Heidelberg Institute for Theoretical Studies HITS gGmbH Schloss-Wolfsbrunnenweg 35 D-69118 Heidelberg, Germany	E-mail: solon.pissisᏍkcl.ac.uk Papers on our conference 2009: Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies (updated Jan 2010) 2012: New and Efficient Approaches to the Quasiperiodic Characterisation of a String
Radomír Polách Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: polacradᏍfit.cvut.cz phone:
Martin Poliak Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: martin.poliakᏍcentrum.cz phone:
Kerttu Pollari-Malmi Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: kerttu.pollari-malmiᏍaalto.fi Papers on our conference 2014: Speeding up Compressed Matching with SBNDM2
Alexandru Popa Department of Computer Science, University of Bristol, Merchant Venturer's Building Woodland Road, Bristol, BS8 1UB United Kingdom	E-mail: popaᏍcs.bris.ac.uk Papers on our conference 2010: (In)approximability Results for Pattern Matching Problems
Elise Prieur-Gaston LITIS EA 4108 Université de Rouen 76821 Mont Saint Aignan Cedex France	E-mail: elise.prieurᏍuniv-rouen.fr Papers on our conference 2005: From Suffix Trees to Suffix Vectors 2011: Computing Abelian Periods in Words 2012: Quasi-linear Time Computation of the Abelian Periods of a Word 2018: Three Strategies for the Dead-Zone String Matching Algorithm
Petr Procházka Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: petr.prochᏍseznam.cz phone:
Xavier Provençal Laboratoire de Combinatoire et d'Informatique Mathèmatique Universitè du Quèbec à Montrèal CP 8888, Succ. Centre-ville Montrèal H3C3P8 Canada	E-mail: provencaᏍlacim.uqam.ca Papers on our conference 2006: On the Problem of Deciding If a Polyomino Tiles the Plane by Translation
Daniel Průša Center for Machine Perception Department for Cybernetics Faculty of Electrical Eng. Czech Technical University in Prague Prague	E-mail: daniel.prusaᏍcentrum.cz phone: +420 776 266 241 Papers on our conference 2006: 2D Context-Free Grammars: Mathematical Formulae Recognition
Rafał Przywarski Computer Engineering Department Technical University of Łódź Al. Politechniki 11, 90–924 Łódź Poland	Papers on our conference 2006: FM-KZ: An Even Simpler Alphabet-Independent FM-Index
Simon J. Puglisi Department of Computer Science University of Helsinki PO Box 68, FI--00014, Finland	E-mail: puglisiᏍcs.helsinki.fi Papers on our conference 2005: A Taxonomy of Suffix Array Construction Algorithms 2008: Fast Optimal Algorithms for Computing All the Repeats in a String 2012: New and Efficient Approaches to the Quasiperiodic Characterisation of a String 2013: Crochemore's String Matching Algorithm: Simplification, Extensions, Applications 2014: Closed Factorization 2017: Dynamic Succinct Data Structures and Compressed Random Access Memory
Jakub Radoszewski Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland	E-mail: jradᏍmimuw.edu.pl Papers on our conference 2010: New Simple Efficient Algorithms Computing Powers and Runs in Strings 2019: Pattern Matching on Weighted Strings
Mohammad Sohel Rahman Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka, Bangladesh Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: msrahmanᏍcse.buet.ac.bd Papers on our conference 2006: Song Classifications for Dancing 2009: Finding all covers of an indeterminate string in O(n) time on average 2013: Maximal Palindromic Factorization 2013: Degenerate String Reconstruction from Cover Arrays 2016: Algorithms to Compute the Lyndon Array 2018: A Faster V-order String Comparison Algorithm
Marcin Raniszewski Institute of Applied Computer Science Łódź University of Technology Al. Politechniki 11, 90–924 Łódź Poland	E-mail: mraniszᏍkis.p.lodz.pl Papers on our conference 2014: Two Simple Full-Text Indexes Based on the Suffix Array
Jussi Rautio Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: kipunaᏍgmail.com Papers on our conference 2005: Context-dependent Stopper encoding 2014: Speeding up Compressed Matching with SBNDM2
S. Ravindran Department of Computer Science Liverpool John Moores University Byrom Street Liverpool United Kingdom	E-mail: S.RavindranᏍlivjm.ac.uk Papers on our conference 1999: A Fast String Matching Algorithm and Experimental Results 2001: Searching in an Efficiently Stored DNA Text Using a Hardware Solution 2001: A linear time string matching algorithm on average with efficient text storage
Sébastien Rebecchi	E-mail: sebastien.rebecchiᏍliris.cnrs.fr Papers on our conference 2008: On the Uniform Distribution of Strings
Regina Šmídová Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: regina.smidovaᏍfit.cvut.cz
James F. Reid Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: jfrᏍdcs.kcl.ac.uk WWW: www.dcs.kcl.ac.uk/pg/jfr/ Papers on our conference 1998: Validating and Decomposing Partially Occluded Two-Dimensional Images (Extended Abstract)
Antonio Restivo Dipartimento di Matematica e Applicazioni, Università di Palermo, Palermo, Italy	E-mail: restivoᏍmath.unipa.it Papers on our conference 2013: Sorting Suffixes of a Text via its Lyndon Factorization
Corné de Ridder School of Computing University of South Africa Pretoria 0003 South Africa	E-mail: driddcᏍunisa.ac.za Papers on our conference 2006: FireμSat: An Algorithm to Detect Microsatellites in DNA
Franca Rinaldi Dipartimento di Matematica e Informatica Via delle Scienze 206 33100 Udine Italy	E-mail: rinaldiᏍdimi.uniud.it Papers on our conference 2006: Flipping Letters to Minimize the Support of a String
Romeo Rizzi Dipartimento di Matematica e Informatica Via delle Scienze 206 33100 Udine Italy	E-mail: rizziᏍdimi.uniud.it Papers on our conference 2006: Flipping Letters to Minimize the Support of a String 2010: Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms
Robert Vaser Faculty of Electrical Engineering and Computing Unska 3, 10000 Zagreb Croatia	E-mail: robert.vaserᏍfer.hr Papers on our conference 2017: Trade-offs in Query and Target Indexing for the Selection of Candidates in Protein Homology Searches
Robin Obůrka Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: oburkrobᏍfit.cvut.cz Papers on our conference 2020: Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array
Giovanna Rosone Dipartimento di Matematica e Applicazioni, Università di Palermo, Palermo, Italy	E-mail: giovannaᏍmath.unipa.it Papers on our conference 2013: Sorting Suffixes of a Text via its Lyndon Factorization
Mikhail Rubinchik Institute of Mathematics and Computer Sciences Ural Federal University named after First President of Russia B.N. Yeltsin 620002, Ekaterinburg, ul. Mira, 19	E-mail: mikhail.rubinchikᏍgmail.com Papers on our conference 2013: Finding Distinct Subpalindromes Online
Ryo Hirakawa Department of Information Science and Technology Kyushu University, Fukuoka, Japan	E-mail: hirakawa.ryo.460Ꮝs.kyushu-u.ac.jp Papers on our conference 2021: Counting Lyndon Subsequences
Wojciech Rytter Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: rytterᏍmimuw.edu.pl WWW: www.mimuw.edu.pl/~rytter Papers on our conference 2004: A First Approach to Finding Common Motifs With Gaps 2008: Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words 2009: Asymptotic Behaviour of the Maximal Number of Squares in Standard Sturmian Words 2010: New Simple Efficient Algorithms Computing Powers and Runs in Strings 2011: Computing the Number of Cubic Runs in Standard Sturmian Words 2011: Observations On Compressed Pattern-Matching with Ranked Variables in Zimin Words 2012: The Number of Cubes in Sturmian Words
Martin Rýzl Sun Microsystems Czech, s.r.o. The Park, Building 3 V Parku 2308/8 148 00 Praha 4
Marie-France Sagot BAOBAB Team Inria Rhone-Alpes Projet HELIX UMR 5558 Biometrie et Biologie Evolutive Université Claude Bernard Lyon 1 43, Bd du 11 Novembre 1918 69622 Villeurbanne cedex France UMR 5558 CNRS Biométrie et Biologie Evolutive Université Claude Bernard Lyon 1 43, Bd. du 11 Novembre 1918 69622 Villeurbanne cedex France	E-mail: Marie-France.SagotᏍinria.fr WWW: http://www.inrialpes.fr/helix/people/sagot phone: (+33) 472 448 238 Papers on our conference 2004: A First Approach to Finding Common Motifs With Gaps 2006: The Gapped-Factor Tree 2011: Finding Long and Multiple Repeats with Edit Distance
Alejandro Salinger Department of Computer Science University of Chile Blanco Encalada 2120 Santiago Chile	E-mail: asalingeᏍdcc.uchile.cl Papers on our conference 2005: A Simple Alphabet-Independent FM-Index 2006: FM-KZ: An Even Simpler Alphabet-Independent FM-Index
Mikaël Salson LITIS EA 4108 Université de Rouen 76821 Mont Saint Aignan Cedex France	Papers on our conference 2008: Dynamic Burrows-Wheeler Transform
Sapir Asraf Department of Computer Science and Mathematics Ariel University Ariel 40700 Israel	E-mail: asrafsapirᏍgmail.com Papers on our conference 2020: New Compression Schemes for Natural Number Sequences
Takashi Sato Dept. Arts and Sciences (Computer Science) Osaka Kyoiku University 4-698-1 Asahigaoka Kashiwara, 582 Japan	E-mail: satoᏍcs.osaka-kyoiku.ac.jp Papers on our conference 1996: Fast Full Text Search Using Tree Structured[TS] File
Satoshi Kobayashi Graduate School of Information Science Tohoku University Aramaki aza Aoba 6-6-05, Aoba-ku Sendai 980-8579 Japan	E-mail: satoshi_kobayashiᏍshino.ecei.tohoku.ac.jp Papers on our conference 2019: An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm
Agata Savary Université François Rabelais de Tours LI/Campus de Blois, France 3 place Jean Jaurés 41000 Blois, France	E-mail: agata.savaryᏍuniv-tours.fr Papers on our conference 2005: Incremental String Correction: Towards Correction of XML Documents
Russell Schwartz Department of Biological Sciences and Lane Center for Computational Biology, Carnegie Mellon University 5000 Forbes Ave., Pittsburgh 15213, PA, USA	E-mail: russellsᏍandrew.cmu.edu Papers on our conference 2010: Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms
Marinella Sciortino Dipartimento di Matematica e Applicazioni, Università di Palermo, Palermo, Italy	E-mail: mariᏍmath.unipa.it Papers on our conference 2013: Sorting Suffixes of a Text via its Lyndon Factorization
Tamar C. Serebro Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel	E-mail: t_lenderᏍhotmail.com Papers on our conference 2006: Modeling Delta Encoding of Compressed Files
Sergio De Agostino Computer Science Department Università di Roma "La Sapienza" Via Salaria 113 00198 Rome Italy	E-mail: deagostinoᏍdi.uniroma1.it WWW: http://twiki.di.uniroma1.it/twiki/view/Users/SergioDeAgostino Papers on our conference 2002: A Work-Optimal Parallel Implementation of Lossless Image Compression by Block Matching 2004: A Simple Lossless Compression Heuristic for Grey Scale Images 2005: Bounded Size Dictionary Compression: Relaxing the LRU Deletion Heuristic 2008: Lossless Image Compression by Block Matching on Practical Massively Parallel Architectures 2008: Speeding up Lossless Image Compression: Experimental Results on a Parallel Machine 2009: Compressing Bi-Level Images by Block Matching on a Tree Architecture 2010: Binary Image Compression via Monochromatic Pattern Substitution: Effectiveness and Scalability 2011: Binary Image Compression via Monochromatic Pattern Substitution: A Sequential Speed-Up 2012: LZW Data Compression on Large Scale and Extreme Distributed Systems 2020: Greedy versus Optimal Analysis of Bounded Size Dictionary Compression and On-the-Fly Distributed Computing 2023: A Worst Case Analysis of the LZ2 Compression Algorithm with Bounded Size Dictionaries
Rifat Shahriyar Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka, Bangladesh	E-mail: rifatᏍcse.buet.ac.bd Papers on our conference 2009: Finding all covers of an indeterminate string in O(n) time on average
Fei Shi Dept. Math and Computer Science Suffolk University Boston, MA 02114-428 USA	E-mail: ShiᏍcas.suffolk.edu Papers on our conference 1999: Centroid Trees with Application to String Processing
Kouji Shimohira Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: kouji.shimohiraᏍinf.kyushu-u.ac.jp Papers on our conference 2011: Computing Longest Common Substring/Subsequence of Non-linear Texts
Dong-Guk Shin Dept. Computer Science and Engineering The University of Connecticut Storrs, CT 06269-3155 USA	E-mail: ShinᏍeng2.uconn.edu Papers on our conference 1999: Centroid Trees with Application to String Processing
Ayumi Shinohara Graduate School of Information Science Tohoku University Aramaki aza Aoba 6-6-05, Aoba-ku Sendai 980-8579 Japan	E-mail: ayumiᏍecei.tohoku.ac.jp WWW: www.shino.ecei.tohoku.ac.jp/~ayumi/indexE.html Papers on our conference 2001: Construction of the CDAWG for a Trie 2002: A Note on Randomized Algorithm for String Matching with Mismatches 2004: A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems 2008: New Lower Bounds for the Maximum Number of Runs in a String 2008: Average Value of Sum of Exponents of Runs in Strings 2009: Bit-parallel algorithms for computing all the runs in a string 2010: Inferring Strings from Runs 2010: Average Number of Runs and Squares in Necklace 2010: The Number of Runs in a Ternary Word 2013: On Morphisms Generating Run-Rich Strings 2016: Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings 2019: An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm
Masami Shishibori Department of Information Science and Intelligent Systems University of Tokushima 2-1 Minami-Josanjima-Cho Tokushima-Shi 770-8506 Japan	E-mail: boriᏍis.tokushima-u.ac.jp Papers on our conference 1996: An Efficient Multi-Attribute Pattern Matching Machine 1997: An Efficient Trie Hashing Method Using a Compact Binary Trie
Shmuel Tomi Klein Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel	E-mail: tomiᏍcs.biu.ac.il WWW: http://u.cs.biu.ac.il/~tomi/ Papers on our conference 2004: Semi-Lossless Text Compression 2005: Compressed Pattern Matching in JPEG Images 2006: Using Alignment for Multilingual Text Compression 2006: Modeling Delta Encoding of Compressed Files 2006: Working with Compressed Concordances 2008: Huffman Coding with Non-Sorted Frequencies 2009: Delta Encoding in a Compressed Domain 2009: On the Usefulness of Backspace 2010: Practical Fixed Length Lempel Ziv Coding 2011: Improving Deduplication Techniques by Accelerating Remainder Calculations 2012: Similarity Based Deduplication with Small Data Chunks 2013: Optimal Partitioning of Data Chunks in Deduplication Systems 2014: Random Access to Fibonacci Codes 2014: Metric Preserving Dense SIFT Compression 2015: Enhanced Extraction from Huffman Encoded Files 2015: Controlling the Chunk-Size in Deduplication Systems 2016: The Use and Usefulness of Fibonacci Codes 2016: Accelerated Partial Decoding in Wavelet Trees 2017: Range Queries Using Huffman Wavelet Trees 2018: Fibonacci Based Compressed Suffix Array 2018: Synchronizing Dynamic Huffman Codes 2019: Bidirectional Adaptive Compression 2019: Selective Dynamic Compression 2020: New Compression Schemes for Natural Number Sequences 2023: Selective Weighted Adaptive Coding 2023: Turning Compression Schemes into Crypto-Systems
Arseny M. Shur Institute of Mathematics and Computer Sciences Ural Federal University named after First President of Russia B.N. Yeltsin 620002, Ekaterinburg, ul. Mira, 19	E-mail: arseny.shurᏍusu.ru Papers on our conference 2013: Finding Distinct Subpalindromes Online
Jeong Seop Sim Electronics and Telecommunications Research Institute Daejeon Korea	E-mail: simjsᏍetri.re.kr Papers on our conference 2003: Approximate Seeds of Strings
Milan Šimánek Sun Microsystems Czech, s.r.o. The Park, Building 3 V Parku 2308/8 148 00 Praha 4	E-mail: Milan.SimanekᏍsun.com Papers on our conference 1998: The Factor Automaton 2003: Operation L-INSERT on Factor Automaton
Simon J. Puglisi Department of Computer Science University of Helsinki PO Box 68, FI--00014, Finland	E-mail: puglisiᏍcs.helsinki.fi Papers on our conference 2017: Dynamic Succinct Data Structures and Compressed Random Access Memory
Jamie Simpson Department of Mathematics & Statistics, Curtin University GPO Box U1987 Perth, 6845 Western Australia	WWW: maths.curtin.edu.au/staff/simpson.cfm Papers on our conference 2010: The Number of Runs in a Ternary Word
Tomáš Skopal Department of Computer Science Faculty of Electrical Engineering and Informatics VSB-Technical University Ostrava 17. listopadu 15 708 33 Ostrava Czech Republic	E-mail: tomas.skopalᏍvsb.cz WWW: www.cs.vsb.cz/skopal/ Papers on our conference 2002: Image Recognition Using Finite Automata
Sebastian Smyczyński Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: smyczekᏍmat.umk.pl Papers on our conference 2009: Constant-memory Iterative Generation of Special Strings Representing Binary Trees 2011: Algorithmics of Posets Generated by Words over Partially Commutative Alphabets
William F. Smyth Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada School of Computer Science and Software Engineering University of Western Australia Crawley WA 6009 Perth, Australia School of Engineering & Information Technology Murdoch University Perth, Australia Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka, Bangladesh	E-mail: smythᏍmcmaster.ca WWW: www.cas.mcmaster.ca/~bill/cv.shtml phone: 1-905-525-9140 ext. 23436 Papers on our conference 2000: Repetitions in two-pattern strings 2002: A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach 2002: String Regularities with Don't Cares 2003: Computing the Minimum k-Cover of a String 2004: Sorting suffixes of two-pattern strings 2005: A Taxonomy of Suffix Array Construction Algorithms 2005: Reconstructing a Suffix Array 2006: Song Classifications for Dancing 2008: An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings 2008: Fast Optimal Algorithms for Computing All the Repeats in a String 2012: New and Efficient Approaches to the Quasiperiodic Characterisation of a String 2012: Quasi-linear Time Computation of the Abelian Periods of a Word 2014: Two Squares Canonical Factorization 2016: Algorithms to Compute the Lyndon Array 2017: The Linear Equivalence of the Suffix Array and the Partially Sorted Lyndon Array 2018: A Faster V-order String Comparison Algorithm 2018: On Baier's Sort of Maximal Lyndon Substrings 2020: Simple KMP Pattern-Matching on Indeterminate Strings 2023: Improved Practical Algorithms to Compute Maximal Covers
Václav Snášel Department of Computer Science Faculty of Electrical Engineering and Informatics VSB-Technical University Ostrava 17. listopadu 15 708 33 Ostrava Czech Republic	E-mail: Vaclav.SnaselᏍvsb.cz WWW: www.cs.vsb.cz/snasel/ Papers on our conference 1997: Algebra of Pattern Matching Problems 1998: Approximate String Matching by Fuzzy Automata 2000: Word-based Compression Method with Direct Access 2002: Image Recognition Using Finite Automata
Michael Soltys Department of Computer Science Californoa State University Channel Islands One University Drive Camarillo CA 93012, USA	E-mail: miraᏍpost.tau.ac.il Papers on our conference 2015: A Formal Framework for Stringology 2016: Forced Repetitions over Alphabet Lists
Stefan Hoffmann Informatikwissenschaften, FB IV Universität Trier Universitätsring 15, 54296 Trier, Germany	E-mail: hoffmannsᏍinformatik.uni-trier.de Papers on our conference 2021: The n-ary Initial Literal and Literal Shuffle
Krzysztof Stencel Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: stencelᏍmimuw.edu.pl Papers on our conference 2010: New Simple Efficient Algorithms Computing Powers and Runs in Strings
Štěpán Plachý Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: stepan.plachyᏍfit.cvut.cz
Jean-Marc Steyaert Laboratoire d'Informatique (LIX) Ecole Polytechnique Palaiseau Cedex France	E-mail: steyaertᏍlix.polytechnique.fr WWW: www.lix.polytechnique.fr/Labo/Jean-Marc.Steyaert/ phone: +33 1 69 33 40 72 Papers on our conference 2003: The Transformation Distance Problem Revisited
Strahil Ristov Ruđer BoĹĄković Institute Department of Electronics Bijenička 54, 10000 Zagreb Croatia	E-mail: ristovᏍirb.hr Papers on our conference 2017: Trade-offs in Query and Target Indexing for the Selection of Candidates in Protein Homology Searches
Tinus Strauss FASTAR Finite Automata Systems – Theoretical and Applied Research group Department of Computer Science, University of Pretoria Pretoria 0002 Republic of South Africa	E-mail: tinusᏍfastar.org Papers on our conference 2006: A Concurrent Specification of Brzozowski's DFA Construction Algorithm 2006: Efficient Automata Constructions and Approximate Automata 2008: A Concurrent Specification of an Incremental DFA Minimisation Algorithm 2009: On Minimizing Deterministic Tree Automata 2014: A Process-Oriented Implementation of Brzozowski's DFA Construction Algorithm
Shiho Sugimoto Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: shiho.sugimotoᏍinf.kyushu-u.ac.jp Papers on our conference 2013: Computing Reversed Lempel-Ziv Factorization Online 2014: Closed Factorization 2019: k-Abelian Pattern Matching: Revisited, Corrected, and Extended
Sukhpal Singh Ghuman Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: Suhkpal.GhumanᏍaalto.fi Papers on our conference 2014: Improved Two-Way Bit-parallel Search 2014: Alternative Algorithms for Lyndon Factorization 2015: Tuning Algorithms for Jumbled Matching 2016: Jumbled Matching with SIMD 2023: Approximate String Searching with AVX2 and AVX-512
Toru Sumitomo Department of Information Science and Intelligent Systems University of Tokushima 2-1 Minami-Josanjima-Cho Tokushima-Shi 770-8506 Japan	Papers on our conference 1997: An Efficient Trie Hashing Method Using a Compact Binary Trie
Jan Šupol	Papers on our conference 2004: Arithmetic Coding in Parallel 2006: 2D Bitwise Memory Matrix: A Tool for Optimal Parallel Approximate Pattern Matching
Robert Susik Institute of Applied Computer Science Łódź University of Technology Al. Politechniki 11, 90–924 Łódź Poland	E-mail: rsusikᏍkis.p.lodz.pl Papers on our conference 2014: Multiple Pattern Matching Revisited
Masayuki Takeda Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: takedaᏍinf.kyushu-u.ac.jp WWW: www.i.kyushu-u.ac.jp/~takeda/ Papers on our conference 2001: Construction of the CDAWG for a Trie 2002: A Note on Randomized Algorithm for String Matching with Mismatches 2004: A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems 2006: Sparse Compact Directed Acyclic Word Graphs 2006: Reachability on Suffix Tree Graphs 2008: Parameterized Suffix Arrays for Binary Strings 2011: Efficient Eager XPath Filtering over XML Streams 2011: Inferring Strings from Suffix Trees and Links on a Binary Alphabet 2011: Computing Longest Common Substring/Subsequence of Non-linear Texts 2013: Computing Reversed Lempel-Ziv Factorization Online 2014: Computing Abelian Covers and Abelian Runs 2015: Computing Left-Right Maximal Generic Words 2016: Computing Smallest and Largest Repetition Factorizations in O(n log n) Time 2016: Dynamic Index and LZ Factorization in Compressed Space 2017: On Reverse Engineering the Lyndon Tree 2018: O(n log n)-time Text Compression by LZ-style Longest First Substitution 2018: Right-to-left Online Construction of Parameterized Position Heaps 2019: Computing Maximal Palindromes and Distinct Palindromes in a Trie 2021: Counting Lyndon Subsequences
Takuya Takagi	E-mail: tkgᏍist.hokudai.ac.jp Papers on our conference 2017: On Reverse Engineering the Lyndon Tree
Tamanna Chhabra Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: Tamanna.ChhabraᏍaalto.fi Papers on our conference 2014: Improved Two-Way Bit-parallel Search 2015: Alternative Algorithms for Order-Preserving Matching 2015: Tuning Algorithms for Jumbled Matching 2023: Approximate String Searching with AVX2 and AVX-512
Teresa Anna Steiner Technical University of Denmark Anker Engelunds Vej 101 2800 Kongens Lyngby
Adrien Thierry Advanced Optimization Laboratory Department of Mathematics and Statistics Faculty of Science McMaster University Hamilton, Ontario Canada L8S 4K1	E-mail: adrien.thierryᏍgmail.com Papers on our conference 2015: Combinatorics of the Interrupted Period
Timo Beller Institute of Theoretical Computer Science Ulm University 89069 Ulm Germany	E-mail: Timo.BellerᏍuni-ulm.de Papers on our conference 2017: A Lempel-Ziv-style Compression Method for Repetitive Texts
Alexander Tiskin Department of Computer Science The University of Warwick University of Warwick, Coventry CV4 7AL, UK	E-mail: tiskinᏍdcs.warwick.ac.uk WWW: http://www2.warwick.ac.uk/fac/sci/dcs/people/Alexander_Tiskin/ Papers on our conference 2013: Parallel Suffix Array Construction by Accelerated Sampling 2014: Threshold Approximate Matching in Grammar-Compressed Strings
Tobias Runge Software Engineering, TU Braunschweig, Germany	E-mail: tobias.rungeᏍtu-bs.de Papers on our conference 2017: Many-MADFAct: Concurrently Constructing MADFAs
Tomáš Pecka Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: peckato1Ꮝfit.cvut.cz Papers on our conference 2020: Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination 2020: Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array
Avraham N. Trahtman Department of Computer Science Bar-Ilan University Ramat-Gan 52900 Israel	E-mail: trakhtᏍmacs.biu.ac.il WWW: www.cs.biu.ac.il/~trakht/ Papers on our conference 2008: The Road Coloring and Černy Conjecture
Jan Trávníček Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Jan.TravnicekᏍfit.cvut.cz phone: +420 224 359 882 Papers on our conference 2020: Conversion of Finite Tree Automata to Regular Tree Expressions By State Elimination 2020: Forward Linearised Tree Pattern Matching Using Tree Pattern Border Array
Zdeněk Troníček Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: tronicekᏍfit.cvut.cz Papers on our conference 1998: Directed Acyclic Subsequence Graph
Athanasios K. Tsakalidis Dept. of Computer Engineering and Informatics Computer Technology Institute University of Patras Patras Greece	E-mail: tsakᏍcti.gr Papers on our conference 2002: String Regularities with Don't Cares 2003: Computing the Repetitions in a Weighted Sequence
Koji Tsuda Computational Biology Research Center	E-mail: koji.tsudaᏍaist.go.jp Papers on our conference 2013: Compact Complete Inverted Files for Texts and Directed Acyclic Graphs Based on Sequence Binary Decision Diagrams
Andrew Turpin School of Computer Science & Information Technology RMIT University GPO Box 2476V Melbourne, Victoria 3001 Australia	E-mail: ahtᏍcs.rmit.edu.au WWW: http://goanna.cs.rmit.edu.au/~aht/ phone: +61 3 9925 9675 Papers on our conference 2005: A Taxonomy of Suffix Array Construction Algorithms
Wojciech Tyczyński Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland	E-mail: w.tyczynskiᏍmimuw.edu.pl Papers on our conference 2012: New and Efficient Approaches to the Quasiperiodic Characterisation of a String
Esko Ukkonen Department of Computer Science University of Helsinki PO Box 68, FI--00014, Finland	E-mail: ukkonenᏍcs.helsinki.fi WWW: www.cs.helsinki.fi/u/ukkonen/ phone: +358-9-1914 4172 Papers on our conference 2003: Matching Numeric Strings under Noise 2018: Discovery of Regulatory Motifs in DNA
Ladislav Vagner Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Ladislav.VagnerᏍfit.cvut.cz WWW: progtest.fit.cvut.cz phone: (+420) 224 359 874
Gianluca Della Vedova Dipartimento di Informatica Sistemistica e Comunicazione Universita degli Studi di Milano - Bicocca 20126 Milano Italy	E-mail: dellavedovaᏍdisco.unimib.it Papers on our conference 2000: Multiple Sequence Alignment as a Facility Location Problem
Fritz Venter Department of Computer Science, University of Pretoria Pretoria 0002 Republic of South Africa	E-mail: fritzᏍfastar.za Papers on our conference 2012: Failure Deterministic Finite Automata
Michal Voráček Dept. of Comp. Sci. & Eng. Faculty of Electrical Eng. Czech Technical University in Prague Prague	E-mail: voracemᏍfel.cvut.cz phone: (+420) 224 357 636
Tomasz Waleń Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland	E-mail: walenᏍmimuw.edu.pl Papers on our conference 2010: New Simple Efficient Algorithms Computing Powers and Runs in Strings
Waltteri Pakalén Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: waltteri.pakalenᏍaalto.fi Papers on our conference 2017: Counting Mismatches with SIMD 2021: Pitfalls of Algorithm Comparison 2021: Searching with Extended Guard and Pivot Loop
Shu Wang Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: shuwᏍmcmaster.ca Papers on our conference 2008: An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings 2023: Periodicity of Degenerate Strings
Bruce W. Watson FASTAR Finite Automata Systems – Theoretical and Applied Research group Department of Computer Science, University of Pretoria Pretoria 0002 Republic of South Africa Department of Mathematical Sciences, Computer Science Division, Stellenbosch University, Private Bag X1, 7602 Matieland, South Africa Centre for Artificial Intelligence Research Meiring Naude Road Pretoria South Africa	E-mail: bruceᏍbruce-watson.com WWW: www.bruce-watson.com Papers on our conference 1996: A Collection of New Regular Grammar Pattern Matching Algorithms 1997: A New Family of String Pattern Matching Algorithms 1997: A Boyer-Moore (or Watson-Watson) Type Algorithm for Regular Tree Pattern Matching 1997: SPARE Parts: A C++ Toolkit for String PAttern REcognition 1998: An Early-Retirement Plan for the States 2000: A new family of Commentz-Walter-style multiple-keyword pattern matching algorithms 2003: Constructing Factor Oracles 2004: A Framework for the Dynamic Implementation of Finite Automata for Performance Enhancement 2005: Reordering Finite Automata States for Fast String Recognition 2006: A Concurrent Specification of Brzozowski's DFA Construction Algorithm 2006: Efficient Automata Constructions and Approximate Automata 2006: On Implementation and Performance of Table-Driven DFA-Based String Processors 2006: FireμSat: An Algorithm to Detect Microsatellites in DNA 2008: A Concurrent Specification of an Incremental DFA Minimisation Algorithm 2008: On Regular Expression Hashing to Reduce FA Size 2009: On Minimizing Deterministic Tree Automata 2010: Improving Automata Efficiency by Stretching and Jamming 2010: Formal Characterizations of FA-based String Processors 2011: On Compile Time Knuth-Morris-Pratt Precomputation 2012: Correctness-by-Construction in Stringology 2012: Failure Deterministic Finite Automata 2012: An Efficient Parallel Determinisation Algorithm for Finite-state Automata 2013: Weak Factor Automata: Comparing (Failure) Oracles and Storacles 2014: A Process-Oriented Implementation of Brzozowski's DFA Construction Algorithm 2014: Using Correctness-by-Construction to Derive Dead-zone Algorithms 2015: Quantum Leap Pattern Matching 2016: Using Human Computation in Dead-zone based 2D Pattern Matching 2017: Many-MADFAct: Concurrently Constructing MADFAs 2018: Three Strategies for the Dead-Zone String Matching Algorithm 2020: Tune-up for the Dead-Zone Algorithm 2021: Pitfalls of Algorithm Comparison 2021: Searching with Extended Guard and Pivot Loop
Richard E. Watson Ribbit Software Systems Inc. IST Technologies Research Group Box 24040, 297 Bernard Ave., Kelowna British Columbia, V1Y 9P9 Canada	E-mail: rwatsonᏍribbitsoft.com Papers on our conference 1997: A New Family of String Pattern Matching Algorithms 1998: An Early-Retirement Plan for the States
Maik Weinard Institut für Informatik Johann Wolfgang Goethe-Universität Frankfurt am Main Robert-Mayer-Straβe 11-15 60054 Frankfurt am Main Germany	E-mail: weinardᏍthi.cs.uni-frankfurt.de Papers on our conference 2004: Conditional Inequalities and the Shortest Common Superstring Problem
Chia-Chun Weng Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: wengc2Ꮝmcmaster.ca Papers on our conference 2011: An Improved Version of the Runs Algorithm Based on Crochemore's Partitioning Algorithm
B. Westgeest Department of Computer Science Armstrong Atlantic State University 11935 Abercorn Street Savannah, Georgia 31419 USA	Papers on our conference 2004: A Simple Lossless Compression Heuristic for Grey Scale Images
Geraint Wiggins Department of Computing School of Informatics City University London EC1V OHB	E-mail: geraintᏍsoi.city.ac.uk WWW: www.soi.city.ac.uk/~geraint/ phone: +44 20 7040 8848
Haim J. Wolfson Department of Computer Science Tel-Aviv University Ramat Aviv 69978 Israel	E-mail: wolfsonᏍmath.tau.ac.il WWW: http://www.cs.tau.ac.il/~wolfson/ Papers on our conference 2011: Inexact Graph Matching by “Geodesic Hashing” for the Alignment of Pseudoknoted RNA Secondary Structures
Xiangdong Xiao Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	Papers on our conference 2002: A Note on Crochemore's Repetitions Algorithm a Fast Space-Efficient Approach
Yair Toaff Toga Networks, a Huawei Company 4 Ha'Harash St Hod Hasharon Israel	E-mail: yair.toaffᏍtoganetworks.com Papers on our conference 2011: Improving Deduplication Techniques by Accelerating Remainder Calculations 2012: Similarity Based Deduplication with Small Data Chunks 2015: Controlling the Chunk-Size in Deduplication Systems 2019: A Fast SIMD-Based Chunking Algorithm
Yasuhiro Yamada Graduate School of Information Science and Electrical Engineering Kyushu University 744 Motooka, Nishiku, Fukuoka 819-0395 Japan	E-mail: yshiroᏍcc.kyushu-u.ac.jp WWW: phone: Papers on our conference 2003: An Efficient Mapping for Score of String Matching
Lu Yang IBM Canada Limited 8200 Warden Avenue Markham ON L6G 1C7 Canada	E-mail: luyangᏍca.ibm.com Papers on our conference 2003: Computing the Minimum k-Cover of a String
Qian Yang Department of Computing&Software Faculty of Engineering McMaster University Hamilton, Ontario Canada L8S 4K1	E-mail: yangq6Ꮝunivmail.cis.mcmaster.ca Papers on our conference 2006: An Asymptotic Lower Bound for the Maximal-Number-of-Runs Function
Yannick Guesnet Université de Rouen 76821 Mont Saint Aignan Cedex France	Papers on our conference 2018: Three Strategies for the Dead-Zone String Matching Algorithm
Yasin Öztürk Informatics Institute Istanbul Technical University, Istanbul, Turkey	E-mail: ozturky17Ꮝitu.edu.tr Papers on our conference 2020: Enumerative Data Compression with Non-Uniquely Decodable Codes
Norihito Yasuda Hokkaido University ERATO MINATO Discrete Structure Manipulation System Project	E-mail: yasudaᏍerato.ist.hokudai.ac.jp Papers on our conference 2014: Fast Regular Expression Matching Based On Dual Glushkov NFA
Yehonatan Dude Toga Networks, a Huawei Company 4 Ha'Harash St Hod Hasharon Israel	E-mail: johnny.davidᏍtoganetworks.com Papers on our conference 2019: A Fast SIMD-Based Chunking Algorithm
Yoav Gross Department of Computer Science and Mathematics Ariel University Ariel 40700 Israel	E-mail: yodgimmelᏍgmail.com Papers on our conference 2023: Selective Weighted Adaptive Coding
Yonatan Feigel Department of Computer Science and Mathematics Ariel University Ariel 40700 Israel	E-mail: feyon9Ꮝgmail.com Papers on our conference 2023: Turning Compression Schemes into Crypto-Systems
Yoshimasa Takabatake Kyushu Institute of Technology Fukuoka, 804-8550 Japan	E-mail: takabatakeᏍai.kyutech.ac.jp Papers on our conference 2020: Re-Pair in Small Space
Ryo Yoshinaka Graduate School of Information Science Tohoku University Aramaki aza Aoba 6-6-05, Aoba-ku Sendai 980-8579 Japan	E-mail: ryoshinakaᏍtohoku.ac.jp Papers on our conference 2011: Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations 2016: Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings 2019: An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm
Joshua Young Department of Mathematics and Computing Science Saint Mary's University 923 Robie Street Halifax, Nova Scotia Canada B3H 3C3	E-mail: jyo04Ꮝhotmail.com Papers on our conference 2013: Deciding the Density Type of a Given Regular Language
Mao Yu Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: yum5Ꮝmcmaster.ca Papers on our conference 2008: An Adaptive Hybrid Pattern-Matching Algorithm on Indeterminate Strings
Yuki Yonemoto Department of Information Science and Technology Kyushu University, Fukuoka, Japan	E-mail: yonemoto.yuuki.240Ꮝs.kyushu-u.ac.jp Papers on our conference 2023: Computing SEQ-IC-LCS of Labeled Graphs
Munina Yusufu Algorithms Research Group Department of Computing & Software Faculty of Science McMaster University Hamilton, Ontario L8S 4L7 Canada	E-mail: yusufumᏍmcmaster.ca Papers on our conference 2008: Fast Optimal Algorithms for Computing All the Repeats in a String
Jan Žďárek Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Thákurova 2700/9 160 00 Prague 6, Czech Republic	E-mail: Jan.ZdarekᏍfit.cvut.cz phone: (+420) 224 357 632, (+420) 224 359 874 Papers on our conference 2010: Simple Tree Pattern Matching for Trees in the Prefix Bar Notation
Lynette van Zijl Department of Mathematical Sciences, Computer Science Division, Stellenbosch University, Private Bag X1, 7602 Matieland, South Africa	E-mail: lvzijlᏍsun.ac.za WWW: http://www.cs.sun.ac.za/~lvzijl/ Papers on our conference 2009: Feature Extraction for Image Pattern Matching with Cellular Automata 2016: Interpreting the Subset Construction Using Finite Sublanguages
Gerard Zwaan Department of Mathematics and Computer Science Technische Universiteit Eindhoven P.O. Box 513, NL-5600 MB Eindhoven The Netherlands	E-mail: g.zwaanᏍtue.nl phone: 4291 (b.g.g. 5145) Papers on our conference 2003: Constructing Factor Oracles 2005: A Missing Link in Root-to-Frontier Tree Pattern Matching
Brink van der Merwe Department of Mathematical Sciences, Computer Science Division, Stellenbosch University, Private Bag X1, 7602 Matieland, South Africa	Papers on our conference 2017: Regular Expressions with Backreferences Re-examined