default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th CPM 2004: Istanbul, Turkey
- Süleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusöz:
Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings. Lecture Notes in Computer Science 3109, Springer 2004, ISBN 3-540-22341-X [contents] - Eric Tannier, Marie-France Sagot:
Sorting by Reversals in Subquadratic Time. 1-13 - Tamar Barzuza, Jacques S. Beckmann
, Ron Shamir, Itsik Pe'er:
Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs. 14-31 - Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter:
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. 32-46 - Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma:
Optimizing Multiple Spaced Seeds for Homology Search. 47-58 - Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson:
Approximate Labelled Subtree Homeomorphism. 59-73 - Svante Janson, Stefano Lonardi, Wojciech Szpankowski:
On the Average Sequence Complexity. 74-88 - Tomoaki Suga, Shinichi Shimozono:
Approximate Point Set Pattern Matching on Sequences and Planes. 89-101 - Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang:
Finding Biclusters by Random Projections. 102-116 - Leszek Gasieniec, Roman M. Kolpakov:
Real-Time String Matching in Sublinear Space. 117-129 - Yishan Jiao, Jingyi Xu, Ming Li:
On the k-Closest Substring and k-Consensus Pattern Problems. 130-144 - Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi:
A Trie-Based Approach for Compacting Automata. 145-158 - Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman:
A Simple Optimal Representation for Balanced Parentheses. 159-172 - Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson:
Two Algorithms for LCS Consecutive Suffix Alignment. 173-193 - Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták:
Efficient Algorithms for Finding Submasses in Weighted Strings. 194-204 - Vincent Berry, François Nicolas:
Maximum Agreement and Compatible Supertrees (Extended Abstract). 205-219 - Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. 220-229 - Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu:
Small Phylogeny Problem: Character Evolution Trees. 230-243 - Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. 244-253 - Eugene Davydov, Serafim Batzoglou:
A Computational Model for RNA Multiple Structural Alignment.. 254-269 - Rolf Backofen, Anke Busch:
Computational Design of New and Recombinant Selenoproteins. 270-284 - Vicky Choi, Navin Goyal:
A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. 285-296 - Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg:
Multi-seed Lossless Filtration (Extended Abstract). 297-310 - Guillaume Blin, Guillaume Fertin, Stéphane Vialette:
New Results for the 2-Interval Pattern Problem. 311-322 - Guojun Li, Xingqin Qi, Xiaoli Wang, Binhai Zhu:
A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes. 323-332 - Nadav Efraty, Gad M. Landau:
Sparse Normalized Local Alignment. 333-346 - Thomas Schmidt, Jens Stoye:
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences. 347-358 - Michel Habib, Christophe Paul, Mathieu Raffinot:
Maximal Common Connected Sets of Interval Graphs. 359-372 - Miklós Csürös:
Performing Local Similarity Searches with Variable Length Seeds. 373-387 - Anne Bergeron, Julia Mixtacki, Jens Stoye:
Reversal Distance without Hurdles and Fortresses. 388-399 - Ricardo A. Baeza-Yates:
A Fast Set Intersection Algorithm for Sorted Sequences. 400-408 - Amihood Amir, Oren Kapah, Dekel Tsur:
Faster Two Dimensional Pattern Matching with Rotations. 409-419 - Veli Mäkinen, Gonzalo Navarro:
Compressed Compact Suffix Arrays. 420-433 - Trinh N. D. Huynh, Wing-Kai Hon, Tak Wah Lam, Wing-Kin Sung:
Approximate String Matching Using Compressed Suffix Arrays. 434-444 - Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam:
Compressed Index for a Dynamic Collection of Texts. 445-456 - Kimmo Fredriksson, Gonzalo Navarro:
Improved Single and Multiple Approximate String Matching. 457-471 - Moritz G. Maaß:
Average-Case Analysis of Approximate Trie Search (Extended Abstract). 472-484
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-10 18:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
