Conferences in DBLP
Amihood Amir Asynchronous Pattern Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:1-10 [Conf ] Eran Halperin SNP and Haplotype Analysis - Algorithms and Applications. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:11-11 [Conf ] Levon Lloyd , Andrew Mehler , Steven Skiena Identifying Co-referential Names Across Large Corpora. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:12-23 [Conf ] Jérémy Barbay , Alexander Golynski , J. Ian Munro , S. Srinivasa Rao Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:24-35 [Conf ] Johannes Fischer , Volker Heun Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:36-48 [Conf ] Ho-Leung Chan , Tak Wah Lam , Wing-Kin Sung , Siu-Lung Tam , Swee-Seong Wong A Linear Size Index for Approximate Pattern Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:49-59 [Conf ] Shunsuke Inenaga , Masayuki Takeda On-Line Linear-Time Construction of Word Suffix Trees. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:60-71 [Conf ] Pang Ko , Srinivas Aluru Obtaining Provably Good Performance from Suffix Trees in Secondary Storage. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:72-83 [Conf ] Tetsuo Shibuya Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:84-93 [Conf ] Brona Brejová , Daniel G. Brown , Ian M. Harrower , Tomás Vinar New Bounds for Motif Finding in Strong Instances. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:94-105 [Conf ] Paola Bonizzoni , Gianluca Della Vedova , Riccardo Dondi , Giancarlo Mauri Fingerprint Clustering with Bounded Number of Missing Values. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:106-116 [Conf ] Olivier Bodini , Eric Rivals Tiling an Interval of the Discrete Line. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:117-128 [Conf ] Eric Blais , Mathieu Blanchette Common Substrings in Random Strings. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:129-140 [Conf ] Firas Swidan , Michal Ziv-Ukelson , Ron Y. Pinter On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:141-152 [Conf ] Sven Rahmann Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:153-164 [Conf ] Sylvain Guillemot , François Nicolas Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:165-176 [Conf ] Behshad Behzadi , Martin Vingron An Improved Algorithm for the Macro-evolutionary Phylogeny Problem. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:177-187 [Conf ] Amihood Amir , Eran Chencinski , Costas S. Iliopoulos , Tsvi Kopelowitz , Hui Zhang Property Matching and Weighted Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:188-199 [Conf ] Amihood Amir , Eran Chencinski Faster Two Dimensional Scaled Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:200-210 [Conf ] Marcin Kubica , Romeo Rizzi , Stéphane Vialette , Tomasz Walen Approximation of RNA Multiple Structural Alignment. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:211-222 [Conf ] Patricia A. Evans Finding Common RNA Pseudoknot Structures in Polynomial Time. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:223-232 [Conf ] Carl Kingsford , Elena Zaslavsky , Mona Singh A Compact Mathematical Programming Formulation for DNA Motif Finding. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:233-245 [Conf ] Rolf Backofen , Danny Hermelin , Gad M. Landau , Oren Weimann Local Alignment of RNA Sequences with Arbitrary Scoring Schemes. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:246-257 [Conf ] Michal Ozery-Flato , Ron Shamir An O(n3/2 sqrt(log n)) Algorithm for Sorting by Reciprocal Translocations. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:258-269 [Conf ] Alexandre Tiskin Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:270-281 [Conf ] Haim Kaplan , Shir Landau , Elad Verbin A Simpler Analysis of Burrows-Wheeler Based Compression. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:282-293 [Conf ] Rodrigo González , Gonzalo Navarro Statistical Encoding of Succinct Data Structures. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:294-305 [Conf ] Veli Mäkinen , Gonzalo Navarro Dynamic Entropy-Compressed Sequences and Full-Text Indexes. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:306-317 [Conf ] Diego Arroyuelo , Gonzalo Navarro , Kunihiko Sadakane Reducing the Space Requirement of LZ-Index. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:318-329 [Conf ] Gerth Stølting Brodal , Kanela Kaligosi , Irit Katriel , Martin Kutz Faster Algorithms for Computing Longest Common Increasing Subsequences. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:330-341 [Conf ] Roman Kolpakov , Mathieu Raffinot New Algorithms for Text Fingerprinting. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:342-353 [Conf ] Leena Salmela , Jorma Tarhio Sublinear Algorithms for Parameterized Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:354-364 [Conf ] Amihood Amir , Costas S. Iliopoulos , Oren Kapah , Ely Porat Approximate Matching in Weighted Sequences. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:365-376 [Conf ] Jesper Jansson , Zeshan Peng Algorithms for Finding a Most Similar Subforest. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:377-388 [Conf ] Yun Sheng Chung , Chin Lung Lu , Chuan Yi Tang Efficient Algorithms for Regular Expression Constrained Sequence Alignment. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:389-400 [Conf ] Aude Liefooghe , Hélène Touzet , Jean-Stéphane Varré Large Scale Matching for Position Weight Matrices. [Citation Graph (0, 0)][DBLP ] CPM, 2006, pp:401-412 [Conf ]