Combinatorial Pattern Matching, 2007 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Ma Bin, Zhang Kaizhong
This volume features select refereed proceedings from the 18th Annual Symposium on Combinatorial Pattern Matching. Collectively, the papers provide great insights into the most recent advances in combinatorial pattern matching. They are organized into topical sections covering algorithmic techniques, approximate pattern matching, data compression, computational biology, pattern analysis, suffix arrays and trees, and algorithmic techniques.
Presents the proceedings from the 18th Annual Symposium on Combinatorial Pattern Matching
Provides new insights in the most recent advances in combinatorial pattern matching
Covers algorithmic techniques, approximate pattern matching, data compression, computational biology, pattern analysis, suffix arrays and trees, and algorithmic techniques
Date de parution : 06-2007
Ouvrage de 368 p.
15.5x23.5 cm
Thème de Combinatorial Pattern Matching :
Mots-clés :
Alphabet; DOM; Pattern Matching; Variable; algorithms; approximation; bioinformatics; coding and data compression; combinatorial pattern matching; computational discrete mathematics; data analysis; data compression; data mining; dynamic programming; genome; algorithm analysis and problem complexity; data structures