Combinatorial pattern matching. 14th annual symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25--27, 2003. Proceedings. (Q1880554)

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 0992.00039) Indexed articles: \textit{Abouelhoda, Mohamed Ibrahim; Ohlebusch, Enno}, Multiple genome alignment: chaining algorithms revisited, 1-16 [Zbl 1279.92062] \textit{Amir, Amihood; Butman, Ayelet; Crochemore, Maxime; Landau, Gad M.; Schaps, Malka}, Two-dimensional pattern matching with rotations, 17-31 [Zbl 1279.68363] \textit{Behzadi, Behshad; Steyaert, Jean-Marc}, An improved algorithm for generalized comparison of minisatellites, 32-41 [Zbl 1279.68364] \textit{Brejová, Broňa; Brown, Daniel G.; Vinař, Tomáš}, Optimal spaced seeds for hidden Markov models, with application to homologous coding regions, 42-54 [Zbl 1279.92063] \textit{Burkhardt, Stefan; Kärkkäinen, Juha}, Fast lightweight suffix array construction and checking, 55-69 [Zbl 1279.68065] \textit{Clifford, Raphaël; Sergot, Marek}, Distributed and paged suffix trees for large genetic databases, 70-82 [Zbl 1279.68066] \textit{Dulucq, Serge; Touzet, Hélène}, Analysis of tree edit distance algorithms, 83-95 [Zbl 1279.68067] \textit{Elemento, Olivier; Gascuel, Olivier}, An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees, 96-108 [Zbl 1279.68365] \textit{Fredriksson, Kimmo; Navarro, Gonzalo}, Average-optimal multiple approximate string matching, 109-128 [Zbl 1279.68366] \textit{Giancarlo, Raffaele; Sciortino, Marinella}, Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms, 129-143 [Zbl 1279.68367] \textit{Hartman, Tzvika}, A simpler 1.5-approximation algorithm for sorting by transpositions, 156-169 [Zbl 1279.68071] \textit{Kaplan, Haim; Verbin, Elad}, Efficient data structures and a new randomized approach for sorting signed permutations by reversals, 170-185 [Zbl 1279.68072] \textit{Kim, Dong Kyue; Sim, Jeong Seop; Park, Heejin; Park, Kunsoo}, Linear-time construction of suffix arrays (extended abstract), 186-199 [Zbl 1279.68068] \textit{Ko, Pang; Aluru, Srinivas}, Space efficient linear time construction of suffix arrays, 200-210 [Zbl 1279.68069] \textit{Kytöjoki, Jari; Salmela, Leena; Tarhio, Jorma}, Tuning string matching for huge pattern sets, 211-224 [Zbl 1279.68368] \textit{Landau, Gad M.; Schieber, Baruch; Ziv-Ukelson, Michal}, Sparse LCS common substring alignment, 225-236 [Zbl 1279.68369] \textit{Lemström, Kjell; Mäkinen, Veli}, On minimizing pattern splitting in multi-track string matching, 237-253 [Zbl 1279.68370] \textit{Ma, Bin; Wang, Zhuozhi; Zhang, Kaizhong}, Alignment between two multiple alignments, 254-265 [Zbl 1279.68372] \textit{Ma, Bin; Zhang, Kaizhong; Liang, Chengzhi}, An effective algorithm for the peptide \textit{de novo} sequencing from MS/MS spectrum, 266-277 [Zbl 1279.92065] \textit{Mauri, Giancarlo; Pavesi, Giulio}, Pattern discovery in RNA secondary structure using affix trees, 278-294 [Zbl 1279.92066] \textit{Nedjah, Nadia; Mourelle, Luiza de Macedo}, More efficient left-to-right pattern matching in non-sequential equational programs, 295-314 [Zbl 1279.68373] \textit{Nicolas, François; Rivals, Eric}, Complexities of the centre and median string problems, 315-327 [Zbl 1279.68107] \textit{Pelfrêne, Johann; Abdeddaïm, Saïd; Alexandre, Joël}, Extracting approximate patterns (extended abstract), 328-347 [Zbl 1279.68374] \textit{Sakamoto, Hiroshi}, A fully linear-time approximation algorithm for grammar-based compression, 348-360 [Zbl 1279.68375] \textit{Valiente, Gabriel}, Constrained tree inclusion, 361-371 [Zbl 1279.68348] \textit{Walter, Maria Emilia M. T.; Curado, Luiz Reginaldo A. F.; Oliveira, Adilton G.}, Working on the problem of sorting by transpositions on genome rearrangements, 372-383 [Zbl 1279.92067]