CPM 2007: London, Ontario, Canada
Invited speakers.
Proceedings.
- Shay Mozes, Oren Weimann, Michal Ziv-Ukelson:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. 4-15
download presentation (PPT)
download paper
- Carmel Kent, Moshe Lewenstein, Dafna Sheinwald:
On Demand String Sorting over Unbounded Alphabets. 16-27
download presentation (PPT)
download paper
- Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding Witnesses by Peeling. 28-39
download presentation (PDF)
download paper
- Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter:
Cache-Oblivious Index for Approximate String Matching. 40-51
download presentation (PDF)
download paper
- Philip Bille, Rolf Fagerberg, Inge Li Gortz:
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. 52-62
download presentation (PDF)
download paper
- Peter Clifford, Raphael Clifford:
Self-normalised Distance with Don't Cares. 63-70
download presentation (PDF)
download paper
- Travis Gagie, Giovanni Manzini:
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited. 71-82
download presentation (PDF)
download paper
- Diego Arroyuelo, Gonzalo Navarro:
A Lempel-Ziv Text Index on Secondary Storage. 83-94
download presentation (PPT)
download paper
- Sunho Lee, Kunsoo Park:
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts. 95-106
download presentation (PPT)
download paper
- Haim Kaplan, Elad Verbin:
Most Burrows-Wheeler Based Compressors Are Not Optimal. 107-118
download presentation (PPT)
download paper
- Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu:
Non-breaking Similarity of Genomes with Gene Repetitions. 119-130
download presentation (PPT)
download paper
- Maxime Benoit-Gagne, Sylvie Hamel:
A New and Faster Method of Sorting by Transpositions. 131-141
download presentation (PDF)
download paper
- Jianbo Qian, Shuai Cheng Li, Dongbo Bu, Ming Li, Jinbo Xu:
Finding Compact Structural Motifs. 142-149
download presentation (PPT)
download paper
- Yufeng Wu, Dan Gusfield:
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. 150-161
download presentation (PPT)
download paper
- Jing Zhang, Xi Chen, Ming Li:
Computing Exact p-Value for Structured Motif. 162-172
download presentation (PPT)
download paper
- Ely Porat, Ohad Lipsky:
Improved Sketching of Hamming Distance with Error Correcting. 173-182
download presentation (PPT)
download paper
- Amihood Amir, Oren Kapah, Ely Porat:
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. 183-194
download presentation (PPT)
download paper
- Zeshan Peng, Hing-Fung Ting:
Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge. 195-204
download presentation (PPT)
download paper
- Niko Valimaki, Veli Makinen:
Space-Efficient Algorithms for Document Retrieval. 205-215
download presentation (PPT)
download paper
- Rodrigo Gonzelez, Gonzalo Navarro:
Compressed Text Indexes with Fast Locate. 216-227
download presentation (PDF)
download paper
- Yury Lifshits:
Processing Compressed Texts: A Tractability Border. 228-240
download presentation (PDF)
download paper
- Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stephane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. 241-252
download presentation (PDF)
download paper
- WangSen Feng, Zhanyong Wang, Lusheng Wang:
Identification of Distinguishing Motifs. 253-264
download presentation (PPT)
download paper
- Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen:
Algorithms for Computing the Longest Parameterized Common Subsequence. 265-273
download presentation (PDF)
download paper
- Sylvain Guillemot, Vincent Berry:
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. 274-285
download presentation (PDF)
download paper
- Amihood Amir, Johannes Fischer, Moshe Lewenstein:
Two-Dimensional Range Minimum Queries. 286-294
download presentation (PDF)
download paper
- Juhani Karhumaki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. 295-306
download presentation (PDF)
download paper
- Gang Chen, Simon J. Puglisi, William F. Smyth:
Fast and Practical Algorithms for Computing All the Runs in a String. 307-315
download presentation (PPT)
download paper
- Mathilde Bouvel, Dominique Rossin, Stephane Vialette:
Longest Common Separable Pattern Among Permutations. 316-327
download presentation (PDF)
download paper
- Paolo Ferragina, Johannes Fischer:
Suffix Arrays on Words. 328-339
download presentation (PDF)
download paper
- Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. 340-351
download presentation (PPT)
download paper
- Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. 352-364
download presentation (PPT)
download paper