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