Combinatorial pattern matching. 16th annual symposium, CPM 2005, Jeju Island, Korea, June 19--22, 2005. Proceedings. (Q2574651)

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1052.68008). Indexed articles: \textit{Brejová, Broňa; Brown, Daniel G.; Harrower, Ian M.; López-Ortiz, Alejandro; Vinař, Tomáš}, Sharper upper and lower bounds for an approximation scheme for Consensus-Pattern, 1-10 [Zbl 1130.68312] \textit{Ma, Bin; Zhang, Kaizhong}, On the longest common rigid subsequence problem, 11-20 [Zbl 1131.68495] \textit{Maaß, Moritz G.; Nowak, Johannes}, Text indexing with errors, 21-32 [Zbl 1131.68430] \textit{Kim, Dong Kyue; Park, Heejin}, A new compressed suffix tree supporting fast search and its construction algorithm using optimal working space, 33-44 [Zbl 1131.68428] \textit{Mäkinen, Veli; Navarro, Gonzalo}, Succinct suffix arrays based on run-length encoding, 45-56 [Zbl 1131.68431] \textit{Na, Joong Chae}, Linear-time construction of compressed suffix arrays using \(o ( n \log n\))-bit working space for large alphabets, 57-67 [Zbl 1131.68432] \textit{Clifford, Peter; Clifford, Raphaël; Iliopoulos, Costas}, Faster algorithms for \(\delta, \gamma\)-matching and related problems, 68-78 [Zbl 1131.68583] \textit{Liu, Zheng; Chen, Xin; Borneman, James; Jiang, Tao}, A fast algorithm for approximate string matching on gene sequences, 79-90 [Zbl 1131.68593] \textit{Amir, Amihood; Lipsky, Ohad; Porat, Ely; Umanski, Julia}, Approximate matching in the \(L_1\) metric, 91-103 [Zbl 1131.68590] \textit{Russo, Luís M. S.; Oliveira, Arlindo L.}, An efficient algorithm for generating super condensed neighborhoods, 104-115 [Zbl 1130.68316] \textit{Ohlebusch, Enno; Abouelhoda, Mohamed Ibrahim; Hockel, Kathrin; Stallkamp, Jan}, The median problem for the reversal distance in circular bacterial genomes, 116-127 [Zbl 1130.92302] \textit{Landau, Gad M.; Parida, Laxmi; Weimann, Oren}, Using PQ trees for comparative genomics, 128-143 [Zbl 1130.92301] \textit{Nicolas, François; Rivals, Eric}, Hardness of optimal spaced seed design, 144-155 [Zbl 1130.68315] \textit{Zhang, Meng; Hu, Liang; Li, Qiang; Ju, Jiubin}, Weighted directed word graph, 156-167 [Zbl 1130.68317] \textit{Dori, Shiri; Landau, Gad M.}, Construction of Aho Corasick automaton in linear time for integer alphabets, 168-177 [Zbl 1130.68313] \textit{Mantaci, Sabrina; Restivo, Antonio; Rosone, G.; Sciortino, Marinella}, An extension of the Burrows Wheeler transform and applications to sequence comparison and data compression, 178-189 [Zbl 1130.68314] \textit{Behzadi, Behshad; Le Fessant, Fabrice}, DNA compression challenge revisited: A dynamic programming approach, 190-200 [Zbl 1130.68308] \textit{Kent, Carmel; Landau, Gad M.; Ziv-Ukelson, Michal}, On the complexity of sparse exon assembly, 201-218 [Zbl 1130.92300] \textit{Horton, Paul; Fujibuchi, Wataru}, An upper bound on the hardness of exact matrix based motif discovery, 219-228 [Zbl 1131.68494] \textit{Pisanti, Nadia; Soldano, Henry; Carpentier, Mathilde}, Incremental inference of relational motifs with a degenerate alphabet, 229-240 [Zbl 1131.68496] \textit{Fredouille, Daniel; Bryant, Christopher H.}, Speeding up parsing of biological context-free grammars, 241-256 [Zbl 1131.68466] \textit{Fan, Kangmin; Smyth, William F.; Simpson, R. J.}, A new periodicity lemma, 257-265 [Zbl 1131.68491] \textit{Hazay, Carmit; Lewenstein, Moshe; Tsur, Dekel}, Two dimensional parameterized matching, 266-279 [Zbl 1131.68493] \textit{Chen, Gen-Huey; Hong, Jin-Ju; Lu, Hsueh-I}, An optimal algorithm for online square detection, 280-287 [Zbl 1131.68582] \textit{Franek, Frantisek; Jennings, Christopher G.; Smyth, William F.}, A simple fast hybrid pattern-matching algorithm, 288-297 [Zbl 1131.68584] \textit{Han, Yo-Sub; Wang, Yajun; Wood, Derick}, Prefix-free regular-expression matching, 298-309 [Zbl 1131.68492] \textit{Ilie, Lucian; Solis-Oba, Roberto; Yu, Sheng}, Reducing the size of NFAs by using equivalences and preorders, 310-321 [Zbl 1131.68470] \textit{Arslan, Abdullah N.}, Regular expression constrained sequence alignment, 322-333 [Zbl 1131.68469] \textit{Touzet, Hélène}, A linear tree edit distance algorithm for similar ordered trees, 334-345 [Zbl 1131.68585] \textit{Aikou, Kazuhide; Suzuki, Yusuke; Shoudai, Takayoshi; Uchida, Tomoyuki; Miyahara, Tetsuhiro}, A polynomial time matching algorithm of ordered tree patterns having height-constrained variables, 346-357 [Zbl 1131.68577] \textit{Boeva, Valentina; Clément, Julien; Régnier, Mireille; Vandenbogaert, Mathias}, Assessing the significance of sets of words, 358-370 [Zbl 1131.68490] \textit{Akutsu, Tatsuya; Fukagawa, Daiji}, Inferring a graph from path frequency, 371-382 [Zbl 1131.68476] \textit{Măndoiu, Ion I.; Trincă, Dragoş}, Exact and approximation algorithms for DNA tag set design, 383-393 [Zbl 1131.92306] \textit{Fernández-Baca, David; Venkatachalam, Balaji}, Parametric analysis for ungapped Markov models of evolution, 394-405 [Zbl 1131.92350] \textit{Tang, Jijun; Moret, Bernard M. E.}, Linear programming for phylogenetic reconstruction based on gene rearrangements, 406-416 [Zbl 1131.92351] \textit{Bock, Mary Ellen; Cortelazzo, Guido M.; Ferrari, Carlo; Guerra, Concettina}, Identifying similar surface patches on proteins using a spin-image surface representation, 417-428 [Zbl 1131.68557] \textit{Böcker, Sebastian; Kaltenbach, Hans-Michael}, Mass spectra alignments and their significance, 429-441 [Zbl 1131.92305]