Combinatorial pattern matching. 15th annual symposium, CPM 2004, Istanbul, Turkey, July 5--7, 2004. Proceedings. (Q704611)

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1045.68007) Indexed articles: \textit{Tannier, Eric; Sagot, Marie-France}, Sorting by reversals in subquadratic time, 1-13 [Zbl 1103.68045] \textit{Barzuza, Tamar; Beckmann, Jacques S.; Shamir, Ron; Pe'er, Itsik}, Computational problems in perfect phylogeny haplotyping: xor-genotypes and tag SNPs, 14-31 [Zbl 1104.92044] \textit{Swidan, Firas; Bender, Michael A.; Ge, Dongdong; He, Simai; Hu, Haodong; Pinter, Ron Y.}, Sorting by length-weighted reversals: Dealing with signs and circularity, 32-46 [Zbl 1103.68492] \textit{Xu, Jinbo; Brown, Daniel G.; Li, Ming; Ma, Bin}, Optimizing multiple spaced seeds for homology search, 47-58 [Zbl 1103.68662] \textit{Pinter, Ron Y.; Rokhlenko, Oleg; Tsur, Dekel; Ziv-Ukelson, Michal}, Approximate labelled subtree homeomorphism, 59-73 [Zbl 1103.68658] \textit{Janson, Svante; Lonardi, Stefano; Szpankowski, Wojciech}, On the average sequence complexity, 74-88 [Zbl 1103.68660] \textit{Suga, Tomoaki; Shimozono, Shinichi}, Approximate point set pattern matching on sequences and planes, 89-101 [Zbl 1103.68986] \textit{Lonardi, Stefano; Szpankowski, Wojciech; Yang, Qiaofeng}, Finding biclusters by random projections, 102-116 [Zbl 1103.68982] \textit{Gąsieniec, Leszek; Kolpakov, Roman}, Real-time string matching in sublinear space, 117-129 [Zbl 1103.68969] \textit{Jiao, Yishan; Xu, Jingyi; Li, Ming}, On the \(k\)-closest substring and \(k\)-consensus pattern problems, 130-144 [Zbl 1103.68140] \textit{Crochemore, Maxime; Epifanio, Chiara; Grossi, Roberto; Mignosi, Filippo}, A trie-based approach for compacting automata, 145-158 [Zbl 1103.68573] \textit{Geary, Richard F.; Rahman, Naila; Raman, Rajeev; Raman, Venkatesh}, A simple optimal representation for balanced parentheses, 159-172 [Zbl 1103.68474] \textit{Landau, Gad M.; Myers, Eugene; Ziv-Ukelson, Michal}, Two algorithms for LCS consecutive suffix alignment, 173-193 [Zbl 1103.68134] \textit{Bansal, Nikhil; Cieliebak, Mark; Lipták, Zsuzsanna}, Efficient algorithms for finding submasses in weighted strings, 194-204 [Zbl 1103.68965] \textit{Berry, Vincent; Nicolas, François}, Maximum agreement and compatible supertrees (extended abstract), 205-219 [Zbl 1103.68966] \textit{Dessmark, Anders; Jansson, Jesper; Lingas, Andrzej; Lundell, Eva-Marta}, Polynomial-time algorithms for the ordered maximum agreement subtree problem, 220-229 [Zbl 1103.68967] \textit{Gupta, Arvind; Maňuch, Ján; Stacho, Ladislav; Zhu, Chenchen}, Small phylogeny problem: Character evolution trees, 230-243 [Zbl 1103.68654] \textit{Berman, Piotr; DasGupta, Bhaskar; Mubayi, Dhruv; Sloan, Robert; Turán, György; Zhang, Yi}, The protein sequence design problem in canonical model on 2D and 3D lattices, 244-253 [Zbl 1103.68563] \textit{Davydov, Eugene; Batzoglou, Serafim}, A computational model for RNA multiple structural alignment, 254-269 [Zbl 1104.92022] \textit{Backofen, Rolf; Busch, Anke}, Computational design of new and recombinant selenoproteins, 270-284 [Zbl 1104.92322] \textit{Choi, Vicky; Goyal, Navin}, A combinatorial shape matching algorithm for rigid protein docking, 285-296 [Zbl 1103.68808] \textit{Kucherov, Gregory; Noé, Laurent; Roytberg, Mikhail}, Multi-seed lossless filtration (extended abstract), 297-310 [Zbl 1103.68661] \textit{Blin, Guillaume; Fertin, Guillaume; Vialette, Stéphane}, New results for the 2-interval pattern problem, 311-322 [Zbl 1103.68059] \textit{Li, Guojun; Qi, Xingqin; Wang, Xiaoli; Zhu, Binhai}, A linear-time algorithm for computing translocation distance between signed genomes, 323-332 [Zbl 1104.92047] \textit{Efraty, Nadav; Landau, Gad M.}, Sparse normalized local alignment, 333-346 [Zbl 1103.68565] \textit{Schmidt, Thomas; Stoye, Jens}, Quadratic time algorithms for finding common intervals in two and more sequences, 347-358 [Zbl 1104.92025] \textit{Habib, Michel; Paul, Christophe; Raffinot, Mathieu}, Maximal common connected sets of interval graphs, 359-372 [Zbl 1103.68655] \textit{Csűrös, Miklós}, Performing local similarity searches with variable length seeds, 373-387 [Zbl 1103.68487] \textit{Bergeron, Anne; Mixtacki, Julia; Stoye, Jens}, Reversal distance without hurdles and fortresses, 388-399 [Zbl 1103.68653] \textit{Baeza-Yates, Ricardo}, A fast set intersection algorithm for sorted sequences, 400-408 [Zbl 1103.68485] \textit{Amir, Amihood; Kapah, Oren; Tsur, Dekel}, Faster two dimensional pattern matching with rotations, 409-419 [Zbl 1103.68743] \textit{Mäkinen, Veli; Navarro, Gonzalo}, Compressed compact suffix arrays, 420-433 [Zbl 1103.68481] \textit{Huynh, Trinh N. D.; Hon, Wing-Kai; Lam, Tak-Wah; Sung, Wing-Kin}, Approximate string matching using compressed suffix arrays, 434-444 [Zbl 1103.68476] \textit{Chan, Ho-Leung; Hon, Wing-Kai; Lam, Tak-Wah}, Compressed index for a dynamic collection of texts, 445-456 [Zbl 1103.68473] \textit{Fredriksson, Kimmo; Navarro, Gonzalo}, Improved single and multiple approximate string matching, 457-471 [Zbl 1103.68488] \textit{Maaß, Moritz G.}, Average-case analysis of approximate trie search, 472-483 [Zbl 1103.68480]