Conferences in DBLP
Andrei Z. Broder Identifying and Filtering Near-Duplicate Documents. [Citation Graph (0, 0)][DBLP ] Conf ] Fernando C. N. Pereira Machine Learning for Efficient Natural-Language Processing. [Citation Graph (0, 0)][DBLP ] Conf ] Ian H. Witten Browsing around a Digital Library: Today and Tomorrow. [Citation Graph (0, 0)][DBLP ] Conf ] Adam L. Buchsbaum , Raffaele Giancarlo Algorithmic Aspects of Speech Recognition: A Synopsis. [Citation Graph (0, 0)][DBLP ] Conf ] Laxmi Parida Some Results on Flexible-Pattern Discovery. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Giegerich Explaining and Controlling Ambiguity in Dynamic Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Sung-Ryul Kim , Kunsoo Park A Dynamic Edit Distance Table. [Citation Graph (0, 0)][DBLP ] Conf ] David Fernández-Baca , Timo Seppäläinen , Giora Slutzki Parametric Multiple Sequence Alignment and Phylogeny Construction. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Horton Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment. [Citation Graph (0, 0)][DBLP ] Conf ] Bin Ma A Polynominal Time Approximation Scheme for the Closest Substring Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Leszek Gasieniec , Jesper Jansson , Andrzej Lingas Approximation Algorithms for Hamming Clustering Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Paola Bonizzoni , Gianluca Della Vedova , Giancarlo Mauri Approximating the Maximum Isomorphic Agreement Subtree Is Hard. [Citation Graph (0, 0)][DBLP ] Conf ] Ming-Yang Kao , Tak Wah Lam , Wing-Kin Sung , Hing-Fung Ting A Faster and Unifying Algorithm for Comparing Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Itsik Pe'er , Ron Shamir , Roded Sharan Incomplete Directed Perfect Phylogeny. [Citation Graph (0, 0)][DBLP ] Conf ] Tao Jiang , Guohui Lin , Bin Ma , Kaizhong Zhang The Longest Common Subsequence Problem for Arc-Annotated Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Gonzalo Navarro , Jorma Tarhio Boyer-Moore String Matching over Ziv-Lempel Compressed Text. [Citation Graph (0, 0)][DBLP ] Conf ] Yusuke Shibata , Tetsuya Matsumoto , Masayuki Takeda , Ayumi Shinohara , Setsuo Arikawa A Boyer-Moore Type Algorithm for Compressed Pattern Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Juha Kärkkäinen , Gonzalo Navarro , Esko Ukkonen Approximate String Matching over Ziv-Lempel Compressed Text. [Citation Graph (0, 0)][DBLP ] Conf ] Shmuel T. Klein Improving Static Compression Schemes by Alphabet Extension. [Citation Graph (0, 0)][DBLP ] Conf ] Nadia El-Mabrouk Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments. [Citation Graph (0, 0)][DBLP ] Conf ] David Bryant A Lower Bound for the Breakpoint Phylogeny Problem. [Citation Graph (0, 0)][DBLP ] Conf ] David Liben-Nowell , Jon M. Kleinberg Structural Properties and Tractability Results for Linear Synteny. [Citation Graph (0, 0)][DBLP ] Conf ] Steven Skiena , Pavel Sumazin Shift Error Detection in Standardized Exams. [Citation Graph (0, 0)][DBLP ] Conf ] Rolf Backofen An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC). [Citation Graph (0, 0)][DBLP ] Conf ] Matthew R. Nelson , Sharon L. Kardia , Charles F. Sing The Combinatorial Partitioning Method. [Citation Graph (0, 0)][DBLP ] Conf ] Veli Mäkinen Compact Suffix Array. [Citation Graph (0, 0)][DBLP ] Conf ] Moritz G. Maaß Linear Bidirectional On-Line Construction of Affix Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Emily Rocke Using Suffix Trees for Gapped Motif Discovery. [Citation Graph (0, 0)][DBLP ] Conf ] Gonzalo Navarro , Erkki Sutinen , Jani Tanninen , Jorma Tarhio Indexing Text with Approximate q-Grams. [Citation Graph (0, 0)][DBLP ] Conf ] Cyril Allauzen , Mathieu Raffinot Simple Optimal String Matching Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Sven Rahmann , Eric Rivals Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts. [Citation Graph (0, 0)][DBLP ] Conf ] Mireille Régnier , Laurent Mouchard Periods and Quasiperiods Characterization. [Citation Graph (0, 0)][DBLP ] Conf ] Gerth Stølting Brodal , Christian N. S. Pedersen Finding Maximal Quasiperiodicities in Strings. [Citation Graph (0, 0)][DBLP ] Conf ] Artur Czumaj , Leszek Gasieniec On the Complexity of Determining the Period of a String. [Citation Graph (0, 0)][DBLP ] Conf ] 