Contacts page
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¹
Dept. of Comp. Sci. & Eng.
Faculty of Electrical Eng.
Czech Technical University in Prague
Prague
E-mail:
antosj@fel.cvut.cz
WWW:
cs.felk.cvut.cz/webis/en/people/antosj.html
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
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
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 357 236
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@i.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
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
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
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 Computer Science
Stellenbosch University,
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
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
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
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
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
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
Maxime Crochemore
Department of Computer Science
King's College London
Strand, London WC2R 2LS
England
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
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:
www.computing.armstrong.edu/FacNStaff/agostino/index.html
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
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
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
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
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
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
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
Dipartimento di Informatica ed Applicazioni
Università di Salerno
Italy
E-mail:
fici@dia.unisa.it
Papers on our conference
2009:
Searching for Jumbled Patterns in Strings
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
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
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
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
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
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
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
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
)
Shunsuke Inenaga
Graduate School of Information Science and Electrical Engineering
Kyushu University
744 Motooka, Nishiku, Fukuoka 819-0395
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
Akira Ishino
Graduate School of Information Science
Tohoku University
Aramaki aza Aoba 6-6-05, Aoba-ku
Sendai 980-8579
Japan
E-mail:
ishino@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
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
