default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th CPM 2007: London, Ontario, Canada
- Bin Ma, Kaizhong Zhang:
Combinatorial Pattern Matching, 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings. Lecture Notes in Computer Science 4580, Springer 2007, ISBN 978-3-540-73436-9
Invited Talks (Abstracts)
- Tao Jiang:
A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search. 1 - S. Muthukrishnan:
Stringology: Some Classic and Some Modern Problems. 2 - Frances F. Yao:
Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors. 3
Algorithmic Techniques I
- Shay Mozes
, Oren Weimann, Michal Ziv-Ukelson:
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. 4-15 - Carmel Kent, Moshe Lewenstein, Dafna Sheinwald:
On Demand String Sorting over Unbounded Alphabets. 16-27
Approximate Pattern Matching
- Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding Witnesses by Peeling. 28-39 - Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Tam, Jeffrey Scott Vitter:
Cache-Oblivious Index for Approximate String Matching. 40-51 - Philip Bille, Rolf Fagerberg, Inge Li Gørtz:
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. 52-62 - Peter Clifford, Raphaël Clifford:
Self-normalised Distance with Don't Cares. 63-70
Data Compression I
- Travis Gagie, Giovanni Manzini:
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited. 71-82 - Diego Arroyuelo, Gonzalo Navarro:
A Lempel-Ziv Text Index on Secondary Storage. 83-94 - Sunho Lee, Kunsoo Park:
Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts. 95-106 - Haim Kaplan, Elad Verbin:
Most Burrows-Wheeler Based Compressors Are Not Optimal. 107-118
Computational Biology I
- Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zhiyu Zhao, Binhai Zhu:
Non-breaking Similarity of Genomes with Gene Repetitions. 119-130 - Maxime Benoît-Gagné, Sylvie Hamel:
A New and Faster Method of Sorting by Transpositions. 131-141 - Jianbo Qian, Shuai Cheng Li, Dongbo Bu, Ming Li, Jinbo Xu:
Finding Compact Structural Motifs. 142-149
Computational Biology II
- Yufeng Wu, Dan Gusfield:
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants. 150-161 - Jing Zhang, Xi Chen, Ming Li:
Computing Exact p-Value for Structured Motif. 162-172
Algorithmic Techniques II
- Ely Porat, Ohad Lipsky:
Improved Sketching of Hamming Distance with Error Correcting. 173-182 - Amihood Amir, Oren Kapah, Ely Porat:
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. 183-194 - Zeshan Peng, Hing-Fung Ting:
Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge. 195-204 - Niko Välimäki, Veli Mäkinen:
Space-Efficient Algorithms for Document Retrieval. 205-215
Data Compression II
- Rodrigo González, Gonzalo Navarro:
Compressed Text Indexes with Fast Locate. 216-227 - Yury Lifshits:
Processing Compressed Texts: A Tractability Border. 228-240
Computational Biology III
- Guillaume Fertin, Danny Hermelin, Romeo Rizzi, Stéphane Vialette:
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics. 241-252 - Wangsen Feng, Zhanyong Wang, Lusheng Wang:
Identification of Distinguishing Motifs. 253-264 - Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen:
Algorithms for Computing the Longest Parameterized Common Subsequence. 265-273 - Sylvain Guillemot, Vincent Berry:
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. 274-285
Pattern Analysis
- Amihood Amir, Johannes Fischer, Moshe Lewenstein:
Two-Dimensional Range Minimum Queries. 286-294 - Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. 295-306 - Gang Chen, Simon J. Puglisi, William F. Smyth:
Fast and Practical Algorithms for Computing All the Runs in a String. 307-315 - Mathilde Bouvel, Dominique Rossin, Stéphane Vialette:
Longest Common Separable Pattern Among Permutations. 316-327
Suffix Arrays and Trees
- Paolo Ferragina, Johannes Fischer:
Suffix Arrays on Words. 328-339 - Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. 340-351 - Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. 352-364
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-16 21:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
