Conferences in DBLP
Brona Brejová , Daniel G. Brown , Ian M. Harrower , Alejandro López-Ortiz , Tomás Vinar Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:1-10 [Conf ] Bin Ma , Kaizhong Zhang On the Longest Common Rigid Subsequence Problem. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:11-20 [Conf ] Moritz G. Maaß , Johannes Nowak Text Indexing with Errors. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:21-32 [Conf ] Dong Kyue Kim , Heejin Park A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:33-44 [Conf ] Veli Mäkinen , Gonzalo Navarro Succinct Suffix Arrays Based on Run-Length Encoding. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:45-56 [Conf ] Joong Chae Na Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:57-67 [Conf ] Peter Clifford , Raphaël Clifford , Costas S. Iliopoulos Faster Algorithms for delta, gamma-Matching and Related Problems. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:68-78 [Conf ] Zheng Liu , Xin Chen , James Borneman , Tao Jiang A Fast Algorithm for Approximate String Matching on Gene Sequences. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:79-90 [Conf ] Amihood Amir , Ohad Lipsky , Ely Porat , Julia Umanski Approximate Matching in the L_{1} Metric. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:91-103 [Conf ] Luís M. S. Russo , Arlindo L. Oliveira An Efficient Algorithm for Generating Super Condensed Neighborhoods. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:104-115 [Conf ] Enno Ohlebusch , Mohamed Ibrahim Abouelhoda , Kathrin Hockel , Jan Stallkamp The Median Problem for the Reversal Distance in Circular Bacterial Genomes. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:116-127 [Conf ] Gad M. Landau , Laxmi Parida , Oren Weimann Using PQ Trees for Comparative Genomics. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:128-143 [Conf ] François Nicolas , Eric Rivals Hardness of Optimal Spaced Seed Design. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:144-155 [Conf ] Meng Zhang , Liang Hu , Qiang Li , Jiubin Ju Weighted Directed Word Graph. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:156-167 [Conf ] Shiri Dori , Gad M. Landau Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:168-177 [Conf ] Sabrina Mantaci , Antonio Restivo , G. Rosone , Marinella Sciortino An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:178-189 [Conf ] Behshad Behzadi , Fabrice Le Fessant DNA Compression Challenge Revisited: A Dynamic Programming Approach. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:190-200 [Conf ] Carmel Kent , Gad M. Landau , Michal Ziv-Ukelson On the Complexity of Sparse Exon Assembly. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:201-218 [Conf ] Paul Horton , Wataru Fujibuchi An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:219-228 [Conf ] Nadia Pisanti , Henry Soldano , Mathilde Carpentier Incremental Inference of Relational Motifs with a Degenerate Alphabet. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:229-240 [Conf ] Daniel Fredouille , Christopher H. Bryant Speeding up Parsing of Biological Context-Free Grammars. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:241-256 [Conf ] Kangmin Fan , William F. Smyth , R. J. Simpson A New Periodicity Lemma. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:257-265 [Conf ] Carmit Hazay , Moshe Lewenstein , Dekel Tsur Two Dimensional Parameterized Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:266-279 [Conf ] Gen-Huey Chen , Jin-Ju Hong , Hsueh-I Lu An Optimal Algorithm for Online Square Detection. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:280-287 [Conf ] Frantisek Franek , Christopher G. Jennings , William F. Smyth A Simple Fast Hybrid Pattern-Matching Algorithm. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:288-297 [Conf ] Yo-Sub Han , Yajun Wang , Derick Wood Prefix-Free Regular-Expression Matching. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:298-309 [Conf ] Lucian Ilie , Roberto Solis-Oba , Sheng Yu Reducing the Size of NFAs by Using Equivalences and Preorders. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:310-321 [Conf ] Abdullah N. Arslan Regular Expression Constrained Sequence Alignment. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:322-333 [Conf ] Hélène Touzet A Linear Tree Edit Distance Algorithm for Similar Ordered Trees. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:334-345 [Conf ] Kazuhide Aikou , Yusuke Suzuki , Takayoshi Shoudai , Tomoyuki Uchida , Tetsuhiro Miyahara A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:346-357 [Conf ] Valentina Boeva , Julien Clément , Mireille Régnier , Mathias Vandenbogaert Assessing the Significance of Sets of Words. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:358-370 [Conf ] Tatsuya Akutsu , Daiji Fukagawa Inferring a Graph from Path Frequency. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:371-382 [Conf ] Ion I. Mandoiu , Dragos Trinca Exact and Approximation Algorithms for DNA Tag Set Design. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:383-393 [Conf ] David Fernández-Baca , Balaji Venkatachalam Parametric Analysis for Ungapped Markov Models of Evolution. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:394-405 [Conf ] Jijun Tang , Bernard M. E. Moret Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:406-416 [Conf ] Mary Ellen Bock , Guido Maria Cortelazzo , Carlo Ferrari , Concettina Guerra Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:417-428 [Conf ] Sebastian Böcker , Hans-Michael Kaltenbach Mass Spectra Alignments and Their Significance. [Citation Graph (0, 0)][DBLP ] CPM, 2005, pp:429-441 [Conf ]