Conferences in DBLP
Mohamed Ibrahim Abouelhoda , Enno Ohlebusch Multiple Genome Alignment: Chaining Algorithms Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Amihood Amir , Ayelet Butman , Maxime Crochemore , Gad M. Landau , Malka Schaps Two-Dimensional Pattern Matching with Rotations. [Citation Graph (0, 0)][DBLP ] Conf ] Behshad Behzadi , Jean-Marc Steyaert An Improved Algorithm for Generalized Comparison of Minisatellites. [Citation Graph (0, 0)][DBLP ] Conf ] Brona Brejová , Daniel G. Brown , Tomás Vinar Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Burkhardt , Juha Kärkkäinen Fast Lightweight Suffix Array Construction and Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Raphaël Clifford , Marek J. Sergot Distributed and Paged Suffix Trees for Large Genetic Databases. [Citation Graph (0, 0)][DBLP ] Conf ] Serge Dulucq , Hélène Touzet Analysis of Tree Edit Distance Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Elemento , Olivier Gascuel An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Kimmo Fredriksson , Gonzalo Navarro Average-Optimal Multiple Approximate String Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Raffaele Giancarlo , Marinella Sciortino Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Dan Gusfield Haplotype Inference by Pure Parsimony. [Citation Graph (0, 0)][DBLP ] Conf ] Tzvika Hartman A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Elad Verbin Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals. [Citation Graph (0, 0)][DBLP ] Conf ] Dong Kyue Kim , Jeong Seop Sim , Heejin Park , Kunsoo Park Linear-Time Construction of Suffix Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Pang Ko , Srinivas Aluru Space Efficient Linear Time Construction of Suffix Arrays. [Citation Graph (0, 0)][DBLP ] Conf ] Jari Kytöjoki , Leena Salmela , Jorma Tarhio Tuning String Matching for Huge Pattern Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Gad M. Landau , Baruch Schieber , Michal Ziv-Ukelson Sparse LCS Common Substring Alignment. [Citation Graph (0, 0)][DBLP ] Conf ] Kjell Lemström , Veli Mäkinen On Minimizing Pattern Splitting in Multi-track String Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Bin Ma , Zhuozhi Wang , Kaizhong Zhang Alignment between Two Multiple Alignments. [Citation Graph (0, 0)][DBLP ] Conf ] Bin Ma , Kaizhong Zhang , Chengzhi Liang An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum. [Citation Graph (0, 0)][DBLP ] Conf ] Giancarlo Mauri , Giulio Pavesi Pattern Discovery in RNA Secondary Structure Using Affix Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Nadia Nedjah , Luiza de Macedo Mourelle More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs. [Citation Graph (0, 0)][DBLP ] Conf ] François Nicolas , Eric Rivals Complexities of the Centre and Median String Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Johann Pelfrêne , Saïd Abdeddaïm , Joël Alexandre Extracting Approximate Patterns. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Sakamoto A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriel Valiente Constrained Tree Inclusion. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Emilia Telles Walter , Luiz Reginaldo A. F. Curado , Adilton G. Oliveira Working on the Problem of Sorting by Transpositions on Genome Rearrangements. [Citation Graph (0, 0)][DBLP ] Conf ] Jie Zheng , Timothy J. Close , Tao Jiang , Stefano Lonardi Efficient Selection of Unique and Popular Oligos for Large EST Databases. [Citation Graph (0, 0)][DBLP ] Conf ] 