@incollection{Gusfield/08,
AUTHOR = {Gusfield, Dan},
TITLE = {ReCombinatorics: Combinatorial algorithms for studying the history of recombination in populations},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {1-2},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_1},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Munro/08,
AUTHOR = {Munro, J. Ian},
TITLE = {Lower bounds for succinct data structures},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {3-3},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_2},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Raghavan/08,
AUTHOR = {Raghavan, Prabhakar},
TITLE = {The changing face of web search},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {4-4},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_3},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Hundt-Liskiewicz/08,
AUTHOR = {Hundt, Christian and Li{\'s}kiewicz, Maciej},
TITLE = {Two-dimensional pattern matching with combined scaling and rotation},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {5-17},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_4},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kolpakov-Kucherov/08,
AUTHOR = {Kolpakov, Roman and Kucherov, Gregory},
TITLE = {Searching for gapped palindromes},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {18-30},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_5},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Betzler-Fellows-Komusiewicz-Niedermeier/08,
AUTHOR = {Betzler, Nadja and Fellows, Michael R. and Komusiewicz, Christian and Niedermeier, Rolf},
TITLE = {Parameterized algorithms and hardness results for some graph motif problems},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {31-43},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_6},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Li-Bu-Xu-Li/08,
AUTHOR = {Li, Shuai Cheng and Bu, Dongbo and Xu, Jinbo and Li, Ming},
TITLE = {Finding largest well-predicted subset of protein structure models},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {44-55},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_7},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Bergeron-Mixtacki-Stoye/08a,
AUTHOR = {Bergeron, Anne and Mixtacki, Julia and Stoye, Jens},
TITLE = {HP distance via double cut and join distance},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {56-68},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_8},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Mohl-Will-Backofen/08,
AUTHOR = {M{\"o}hl, Mathias and Will, Sebastian and Backofen, Rolf},
TITLE = {Fixed parameter tractable alignment of RNA structures including arbitrary pseudoknots},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {69-81},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_9},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gasieniec-Li-Zhang/08,
AUTHOR = {G{\c{a}}sieniec, Leszek and Li, Cindy Y. and Zhang, Meng},
TITLE = {Faster algorithm for the set variant of the string barcoding problem},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {82-94},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_10},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Marschall-Rahmann/08,
AUTHOR = {Marschall, Tobias and Rahmann, Sven},
TITLE = {Probabilistic arithmetic automata and their application to pattern matching statistics},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {95-106},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_11},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fayolle/08,
AUTHOR = {Fayolle, Julien},
TITLE = {Analysis of the size of antidictionary in DCA},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {107-117},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_12},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Amir-Aumann-Kapah-Levy-Porat/08,
AUTHOR = {Amir, Amihood and Aumann, Yonatan and Kapah, Oren and Levy, Avivit and Porat, Ely},
TITLE = {Approximate string matching with address bit errors},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {118-129},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_13},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Kiwi-Navarro-Telha/08,
AUTHOR = {Kiwi, Marcos and Navarro, Gonzalo and Telha, Claudio},
TITLE = {On-line approximate string matching with bounded errors},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {130-142},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_14},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Clifford-Efremenko-Porat-Porat/08,
AUTHOR = {Clifford, Rapha{\"e}l and Efremenko, Klim and Porat, Benny and Porat, Ely},
TITLE = {A black box for online approximate pattern matching},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {143-151},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_15},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fischer-Makinen-Navarro/08,
AUTHOR = {Fischer, Johannes and M{\"a}kinen, Veli and Navarro, Gonzalo},
TITLE = {An(other) entropy-bounded compressed suffix tree},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {152-165},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_16},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Nitto-Venturini/08,
AUTHOR = {Nitto, Igor and Venturini, Rossano},
TITLE = {On compact representations of all-pairs-shortest-path-distance matrices},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {166-177},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_17},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Nong-Zhang-Chan/08,
AUTHOR = {Nong, Ge and Zhang, Sen and Chan, Wai Hong},
TITLE = {Computing inverse ST in linear complexity},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {178-190},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_18},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Russo-Navarro-Oliveira/08,
AUTHOR = {Russo, Lu{\'{i}}s M.S. and Navarro, Gonzalo and Oliveira, Arlindo},
TITLE = {Dynamic fully-compressed suffix trees},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {191-203},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_19},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Farach-Colton-Huang/08,
AUTHOR = {Farach-Colton, Martin and Huang, Yang},
TITLE = {A linear delay algorithm for building concept lattices},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {204-216},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_20},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Fraczak-Rytter-Yazdani/08,
AUTHOR = {Fraczak, Wojciech and Rytter, Wojciech and Yazdani, Mohammadreza},
TITLE = {Matching integer intervals by minimal sets of binary words with don't cares},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {217-229},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_21},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Mozes-Tsur-Weimann-Ziv-Ukelson/08,
AUTHOR = {Mozes, Shay and Tsur, Dekel and Weimann, Oren and Ziv-Ukelson, Michal},
TITLE = {Fast algorithms for computing tree LCS},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {230-243},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_22},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Ma/08,
AUTHOR = {Ma, Bin},
TITLE = {Why greed works for shortest common superstring problem},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {244-254},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_23},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Gotthilf-Hermelin-Lewenstein/08,
AUTHOR = {Gotthilf, Zvi and Hermelin, Danny and Lewenstein, Moshe},
TITLE = {Constrained LCS: Hardness and approximation},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {255-262},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_24},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Xiao-Wang-Liu-Jiang/08,
AUTHOR = {Xiao, Jing and Wang, Lusheng and Liu, Xiaowen and Jiang, Tao},
TITLE = {Finding additive biclusters with random background},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {263-276},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_25},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Arroyuelo/08,
AUTHOR = {Arroyuelo, Diego},
TITLE = {An improved succinct representation for dynamic $k$-ary trees},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {277-289},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_26},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Crochemore-Ilie-Tinta/08,
AUTHOR = {Crochemore, Maxime and Ilie, Lucian and Tinta, Liviu},
TITLE = {Towards a solution to the ``runs'' conjecture},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {290-302},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_27},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}
@incollection{Keller-Kopelowitz-Lewenstein/08,
AUTHOR = {Keller, Orgad and Kopelowitz, Tsvi and Lewenstein, Moshe},
TITLE = {On the longest common parameterized subsequence},
BOOKTITLE = {Proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM'2008 (Pisa, Italy, June 18-20, 2008)},
SERIES = {LNCS},
VOLUME = {5029},
PAGES = {303-315},
YEAR = {2008},
EDITOR = {Ferragina, Paolo and Landau, Gad M.},
URL = {http://dx.doi.org/10.1007/978-3-540-69068-9_28},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg},
}