|
|
Conferences in DBLP
- Eric Tannier, Marie-France Sagot
Sorting by Reversals in Subquadratic Time. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:1-13 [Conf]
- Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, Itsik Pe'er
Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:14-31 [Conf]
- Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter
Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:32-46 [Conf]
- Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma
Optimizing Multiple Spaced Seeds for Homology Search. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:47-58 [Conf]
- Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson
Approximate Labelled Subtree Homeomorphism. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:59-73 [Conf]
- Svante Janson, Stefano Lonardi, Wojciech Szpankowski
On the Average Sequence Complexity. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:74-88 [Conf]
- Tomoaki Suga, Shinichi Shimozono
Approximate Point Set Pattern Matching on Sequences and Planes. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:89-101 [Conf]
- Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang
Finding Biclusters by Random Projections. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:102-116 [Conf]
- Leszek Gasieniec, Roman M. Kolpakov
Real-Time String Matching in Sublinear Space. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:117-129 [Conf]
- Yishan Jiao, Jingyi Xu, Ming Li
On the k-Closest Substring and k-Consensus Pattern Problems. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:130-144 [Conf]
- Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
A Trie-Based Approach for Compacting Automata. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:145-158 [Conf]
- Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman
A Simple Optimal Representation for Balanced Parentheses. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:159-172 [Conf]
- Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson
Two Algorithms for LCS Consecutive Suffix Alignment. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:173-193 [Conf]
- Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták
Efficient Algorithms for Finding Submasses in Weighted Strings. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:194-204 [Conf]
- Vincent Berry, François Nicolas
Maximum Agreement and Compatible Supertrees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:205-219 [Conf]
- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:220-229 [Conf]
- Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu
Small Phylogeny Problem: Character Evolution Trees. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:230-243 [Conf]
- 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. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:244-253 [Conf]
- Eugene Davydov, Serafim Batzoglou
A Computational Model for RNA Multiple Structural Alignment.. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:254-269 [Conf]
- Rolf Backofen, Anke Busch
Computational Design of New and Recombinant Selenoproteins. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:270-284 [Conf]
- Vicky Choi, Navin Goyal
A Combinatorial Shape Matching Algorithm for Rigid Protein Docking. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:285-296 [Conf]
- Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg
Multi-seed Lossless Filtration (Extended Abstract). [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:297-310 [Conf]
- Guillaume Blin, Guillaume Fertin, Stéphane Vialette
New Results for the 2-Interval Pattern Problem. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:311-322 [Conf]
- Guojun Li, Xingqin Qi, Xiaoli Wang, Binhai Zhu
A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:323-332 [Conf]
- Nadav Efraty, Gad M. Landau
Sparse Normalized Local Alignment. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:333-346 [Conf]
- Thomas Schmidt, Jens Stoye
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:347-358 [Conf]
- Michel Habib, Christophe Paul, Mathieu Raffinot
Maximal Common Connected Sets of Interval Graphs. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:359-372 [Conf]
- Miklós Csürös
Performing Local Similarity Searches with Variable Length Seeds. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:373-387 [Conf]
- Anne Bergeron, Julia Mixtacki, Jens Stoye
Reversal Distance without Hurdles and Fortresses. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:388-399 [Conf]
- Ricardo A. Baeza-Yates
A Fast Set Intersection Algorithm for Sorted Sequences. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:400-408 [Conf]
- Amihood Amir, Oren Kapah, Dekel Tsur
Faster Two Dimensional Pattern Matching with Rotations. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:409-419 [Conf]
- Veli Mäkinen, Gonzalo Navarro
Compressed Compact Suffix Arrays. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:420-433 [Conf]
- Trinh N. D. Huynh, Wing-Kai Hon, Tak Wah Lam, Wing-Kin Sung
Approximate String Matching Using Compressed Suffix Arrays. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:434-444 [Conf]
- Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam
Compressed Index for a Dynamic Collection of Texts. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:445-456 [Conf]
- Kimmo Fredriksson, Gonzalo Navarro
Improved Single and Multiple Approximate String Matching. [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:457-471 [Conf]
- Moritz G. Maaß
Average-Case Analysis of Approximate Trie Search (Extended Abstract). [Citation Graph (0, 0)][DBLP]
CPM, 2004, pp:472-484 [Conf]
|
