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
Julien Allali LaBRI University of Bordeaux I Unité Mixte de Recherche CNRS (UMR 5800) 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	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
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: andrejk@kosice.upjs.sk WWW: kosice.upjs.sk/~kmi/Andrejko/homein.htm 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
Pavlos Antoniou Department of Computer Science King's College London Strand, London WC2R 2LS England	E-mail: pavlos.antoniou@kcl.ac.uk WWW: www.dcs.kcl.ac.uk/pg/pavlosan/ 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 33 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 ERATO MINATO Discrete Structure Manipulation System Project	E-mail: atim@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
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
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
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 King's College London Strand, London WC2R 2LS England	Papers on our conference 2010: Bounded Number of Squares in Infinite Repetition-Constrained Binary Words
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 Kolejní 550/2 160 00 Prague 6, Czech Republic	E-mail: Miroslav.Balik@fit.cvut.cz WWW: cs.felk.cvut.cz/webis/people/balikm.html 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
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
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
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
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
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
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
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
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
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
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 LIFAR–ABISS 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 fur Informatik V Universitat Bonn Romerstrase 164 D-53117 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 Computer Science, University of Pretoria Pretoria 0002 Republic of 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
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, 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
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
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
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
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
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
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
Jean-Pierre Duval LIFAR–ABISS 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
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: http://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
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
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
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) 33405 Talence cedex, France	Papers on our conference 2009: Validation and Decomposition of Partially Occluded Images with Holes
Gabriele Fici Laboratoire I3S in Sophia-Antipolis Université de Nice-Sophia Antipolis, France Grand Château 28 avenue Valrose BP 2135 06103 Nice Cedex 2 France	E-mail: gabriele.fici@unice.fr WWW: http://www.i3s.unice.fr/~fici/ Papers on our conference 2009: Searching for Jumbled Patterns in Strings 2011: Computing Abelian Periods in Words
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
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
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/~franya/ 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
Kimmo Fredriksson Department of Computer Science University of Joensuu PO Box 111, FIN--80101 Joensuu Finland	E-mail: kfredrik@cs.joensuu.fi phone: +358 9 191 44119 Papers on our conference 2005: Flexible Music Retrieval in Sublinear Time 2006: Efficient Algorithms for (δ, γ, α)-Matching
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 Dipartimento di Matematica e Informatica Le facolta scienze matematiche, fisiche e naturali Università di Catania Viale Andrea Doria 6 95125 Catania Italy	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
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 fur Informatik V Universitat Bonn Romerstrase 164 D-53117 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
Szymon Grabowski Computer Engineering Department Technical University of Łódź 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
Richard Groult LIFAR–ABISS 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
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
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
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
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
Michael Hirsch IBM - Diligent IBM Israel HQ, Azorim Park 94 Em Hamoshavot Rd. Kiryat Arie, Petach Tiqva, 49527, Israel	E-mail: hirschm@il.ibm.com Papers on our conference 2011: Improving Deduplication Techniques by Accelerating Remainder Calculations
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
Jan Holub Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Kolejní 550/2 160 00 Prague 6, Czech Republic	E-mail: Jan.Holub@fit.cvut.cz WWW: www.stringology.org/~holub/ phone: (+420) 224 357 644 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 33 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	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
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: csi@dcs.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
Shunsuke Inenaga Department of Informatics Kyushu University 744 Motooka, Nishiku, Fukuoka 812-8581 Japan	E-mail: inenaga@c.csce.kyushu-u.ac.jp WWW: www.ssp.isee.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
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
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
Jan Janoušek Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Kolejní 550/2 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
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
Jean-Michel Jolion	E-mail: jean-michel.jolion@liris.cnrs.fr Papers on our conference 2008: On the Uniform Distribution of Strings
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 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
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
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
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
Josef Kolář Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Kolejní 550/2 160 00 Prague 6, Czech Republic	E-mail: Josef.Kolar@fit.cvut.cz phone: (+420) 224 359 872
Derrick G. Kourie Department of Computer Science, University of Pretoria Pretoria 0002 Republic of 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
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
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 TÜBİTAK-UEKAE National Research Institute of Electronics & Cryptology 41470 Gebze, Kocaeli, Turkey	E-mail: kulekci@uekae.tubitak.gov.tr Papers on our conference 2009: Filter Based Fast Matching of Long Patterns by Using SIMD Instructions
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 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
Jan Lahoda Sun Microsystems Czech, s.r.o. The Park, Building 3 V Parku 2308/8 148 00 Praha 4	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
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
Martine Leonard LIFAR–ABISS 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
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 Department of Mathematics, Faculty of Science Kyoto Sangyo University Kyoto 603-8555, Japan	E-mail: leupold@cc.kyoto-su.ac.jp Papers on our conference 2009: Reducing Repetitions
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
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
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
Wataru Matsubara Graduate School of Information Science Tohoku University Aramaki aza Aoba 6-6-05, Aoba-ku Sendai 980-8579 Japan	E-mail: 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
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 Kolejní 550/2 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
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
Łukasz Mikulski Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: frodo@mat.umk.pl Papers on our conference 2011: Algorithmics of Posets Generated by Words over Partially Commutative Alphabets
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 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
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
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
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
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
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
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
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
T. Paranthoën LIFAR–ABISS 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
Hannu Peltola Department of Computer Science and Engineering Aalto University Konemiehentie 2 02150 Espoo Finland	E-mail: hannu.peltola@aalto.fi Papers on our conference 2011: Variations of Forward-SBNDM
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
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
Marcin Piątkowski Faculty of Mathematics and Computer Science Nicolaus Copernicus University Toruń, Poland	E-mail: martinp@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
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
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	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)
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
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 School of Computer Science & Information Technology RMIT University GPO Box 2476V Melbourne, Victoria 3001 Australia	E-mail: sjp@cs.rmit.edu.au Papers on our conference 2005: A Taxonomy of Suffix Array Construction Algorithms 2008: Fast Optimal Algorithms for Computing All the Repeats in a String
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
Mohammad Sohel Rahman Department of Computer Science and Engineering Bangladesh University of Engineering and Technology Dhaka, Bangladesh	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
Jussi Rautio Laboratory of Information Processing Science Helsinki University of Technology Espoo Finland	E-mail: Jussi.Rautio@hut.fi Papers on our conference 2005: Context-dependent Stopper encoding
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
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)
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
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
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
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
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
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
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
Dana Shapira Department of Computer Science Ashkelon Academic College Ashkelon Israel	E-mail: shapird@ash-college.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
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
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
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
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	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
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
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
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
Tinus Strauss Department of Computer Science, University of Pretoria Pretoria 0002 Republic of South Africa	E-mail: tstrauss@cs.up.ac.za 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
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
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
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
Yair Toaff IBM - Diligent IBM Israel HQ, Azorim Park 94 Em Hamoshavot Rd. Kiryat Arie, Petach Tiqva, 49527, Israel	E-mail: yairtoaff@il.ibm.com Papers on our conference 2011: Improving Deduplication Techniques by Accelerating Remainder Calculations
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
Zdeněk Troníček Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Kolejní 550/2 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
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
Esko Ukkonen Department of Computer Science University of Helsinki 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
Ladislav Vagner Department of Theoretical Computer Science Faculty of Information Technology Czech Technical University in Prague Kolejní 550/2 160 00 Prague 6, Czech Republic	E-mail: Ladislav.Vagner@fit.cvut.cz WWW: moon.felk.cvut.cz/~xvagner/ 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
Michal Voráček Dept. of Comp. Sci. & Eng. Faculty of Electrical Eng. Czech Technical University in Prague Prague	E-mail: voracem@fel.cvut.cz WWW: cs.felk.cvut.cz/~voracem/ 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
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
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	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
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
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
Ryo Yoshinaka Hokkaido University Graduate School of Information Science and Technology Kita 14, Nishi 9 Kita-ku, Sapporo	E-mail: ry@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
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
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 Kolejní 550/2 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
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 WWW: www.win.tue.nl/medewerkers/homepages/g.zwaan.html 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
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
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