- 2007
- Amihood Amir, Johannes Fischer, Moshe Lewenstein:
Two-Dimensional Range Minimum Queries. CPM 2007: 286-294 - Amihood Amir, Oren Kapah, Ely Porat:
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194 - Diego Arroyuelo, Gonzalo Navarro:
A Lempel-Ziv Text Index on Secondary Storage. CPM 2007: 83-94 - Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding Witnesses by Peeling. CPM 2007: 28-39 - Maxime Benoît-Gagné, Sylvie Hamel
:
A New and Faster Method of Sorting by Transpositions. CPM 2007: 131-141 - Philip Bille, Rolf Fagerberg, Inge Li Gørtz
:
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CPM 2007: 52-62 - Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
Longest Common Separable Pattern Among Permutations. CPM 2007: 316-327 - Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu:
Non-breaking Similarity of Genomes with Gene Repetitions. CPM 2007: 119-130 - Gang Chen, Simon J. Puglisi, William F. Smyth:
Fast and Practical Algorithms for Computing All the Runs in a String. CPM 2007: 307-315 - Peter Clifford, Raphaël Clifford
:
Self-normalised Distance with Don't Cares. CPM 2007: 63-70 - Wangsen Feng, Zhanyong Wang, Lusheng Wang:
Identification of Distinguishing Motifs. CPM 2007: 253-264 - Paolo Ferragina, Johannes Fischer:
Suffix Arrays on Words. CPM 2007: 328-339 - Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. CPM 2007: 241-252 - Travis Gagie
, Giovanni Manzini:
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited. CPM 2007: 71-82 - Rodrigo González, Gonzalo Navarro
:
Compressed Text Indexes with Fast Locate. CPM 2007: 216-227 - Sylvain Guillemot, Vincent Berry:
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. CPM 2007: 274-285 - Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter
:
Cache-Oblivious Index for Approximate String Matching. CPM 2007: 40-51 - Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen:
Algorithms for Computing the Longest Parameterized Common Subsequence. CPM 2007: 265-273 - Tao Jiang:
A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search. CPM 2007: 1 - Haim Kaplan, Elad Verbin:
Most Burrows-Wheeler Based Compressors Are Not Optimal. CPM 2007: 107-118 - Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. CPM 2007: 295-306 - Carmel Kent, Moshe Lewenstein, Dafna Sheinwald:
On Demand String Sorting over Unbounded Alphabets. CPM 2007: 16-27 - Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. CPM 2007: 352-364 - Sunho Lee, Kunsoo Park:
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts. CPM 2007: 95-106 - Yury Lifshits:
Processing Compressed Texts: A Tractability Border. CPM 2007: 228-240 - Shay Mozes
, Oren Weimann
, Michal Ziv-Ukelson:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. CPM 2007: 4-15 - S. Muthukrishnan:
Stringology: Some Classic and Some Modern Problems. CPM 2007: 2 - Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351 - Zeshan Peng, Hing-Fung Ting:
Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge. CPM 2007: 195-204 - Ely Porat, Ohad Lipsky:
Improved Sketching of Hamming Distance with Error Correcting. CPM 2007: 173-182