Search results for "CPM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Frantisek Franek, Christopher G. Jennings, William F. Smyth	A Simple Fast Hybrid Pattern-Matching Algorithm.	CPM	2005	DBLP DOI BibTeX RDF
1	Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino	An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression.	CPM	2005	DBLP DOI BibTeX RDF
1	Joong Chae Na	Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets.	CPM	2005	DBLP DOI BibTeX RDF
1	Dong Kyue Kim, Heejin Park	A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space.	CPM	2005	DBLP DOI BibTeX RDF
1	Luís M. S. Russo, Arlindo L. Oliveira	An Efficient Algorithm for Generating Super Condensed Neighborhoods.	CPM	2005	DBLP DOI BibTeX RDF
1	Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos	Faster Algorithms for delta, gamma-Matching and Related Problems.	CPM	2005	DBLP DOI BibTeX RDF
1	Bin Ma 0002, Kaizhong Zhang	On the Longest Common Rigid Subsequence Problem.	CPM	2005	DBLP DOI BibTeX RDF
1	Lucian Ilie, Roberto Solis-Oba, Sheng Yu 0001	Reducing the Size of NFAs by Using Equivalences and Preorders.	CPM	2005	DBLP DOI BibTeX RDF	state complexity, finite automata, equivalences, regular expression matching, preorders
1	Daniel Fredouille, Christopher H. Bryant	Speeding up Parsing of Biological Context-Free Grammars.	CPM	2005	DBLP DOI BibTeX RDF
1	Gen-Huey Chen, Jin-Ju Hong, Hsueh-I Lu	An Optimal Algorithm for Online Square Detection.	CPM	2005	DBLP DOI BibTeX RDF
1	Süleyman Cenk Sahinalp, S. Muthukrishnan 0001, Ugur Dogrusöz (eds.)	Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings	CPM	2004	DBLP DOI BibTeX RDF
1	Kimmo Fredriksson, Gonzalo Navarro 0001	Improved Single and Multiple Approximate String Matching.	CPM	2004	DBLP DOI BibTeX RDF
1	Moritz G. Maaß	Average-Case Analysis of Approximate Trie Search (Extended Abstract).	CPM	2004	DBLP DOI BibTeX RDF
1	Veli Mäkinen, Gonzalo Navarro 0001	Compressed Compact Suffix Arrays.	CPM	2004	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi	A Trie-Based Approach for Compacting Automata.	CPM	2004	DBLP DOI BibTeX RDF	factor and suffix automata, suffix tree, index, text compression, Automata and formal languages
1	Gad M. Landau, Eugene W. Myers, Michal Ziv-Ukelson	Two Algorithms for LCS Consecutive Suffix Alignment.	CPM	2004	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates	A Fast Set Intersection Algorithm for Sorted Sequences.	CPM	2004	DBLP DOI BibTeX RDF	multiple search, inverted indices, merging, Web search engines, Set operations
1	Amihood Amir, Oren Kapah, Dekel Tsur	Faster Two Dimensional Pattern Matching with Rotations.	CPM	2004	DBLP DOI BibTeX RDF	two dimensional pattern matching, rotation, Design and analysis of algorithms
1	Richard F. Geary, Naila Rahman, Rajeev Raman, Venkatesh Raman 0001	A Simple Optimal Representation for Balanced Parentheses.	CPM	2004	DBLP DOI BibTeX RDF
1	Svante Janson, Stefano Lonardi, Wojciech Szpankowski	On the Average Sequence Complexity.	CPM	2004	DBLP DOI BibTeX RDF
1	Guillaume Blin, Guillaume Fertin, Stéphane Vialette	New Results for the 2-Interval Pattern Problem.	CPM	2004	DBLP DOI BibTeX RDF
1	Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, Itsik Pe'er	Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs.	CPM	2004	DBLP DOI BibTeX RDF
1	Eric Tannier, Marie-France Sagot	Sorting by Reversals in Subquadratic Time.	CPM	2004	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Roman M. Kolpakov	Real-Time String Matching in Sublinear Space.	CPM	2004	DBLP DOI BibTeX RDF
1	Ho-Leung Chan, Wing-Kai Hon, Tak Wah Lam	Compressed Index for a Dynamic Collection of Texts.	CPM	2004	DBLP DOI BibTeX RDF
1	Nadav Efraty, Gad M. Landau	Sparse Normalized Local Alignment.	CPM	2004	DBLP DOI BibTeX RDF
1	Anders Dessmark, Jesper Jansson 0001, Andrzej Lingas, Eva-Marta Lundell	Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.	CPM	2004	DBLP DOI BibTeX RDF
1	Guojun Li, Xingqin Qi, Xiaoli Wang, Binhai Zhu	A Linear-Time Algorithm for Computing Translocation Distance between Signed Genomes.	CPM	2004	DBLP DOI BibTeX RDF
1	Tomoaki Suga, Shinichi Shimozono	Approximate Point Set Pattern Matching on Sequences and Planes.	CPM	2004	DBLP DOI BibTeX RDF	point set pattern matching, musical sequence search, edit distance, approximate matching
1	Jinbo Xu, Daniel G. Brown 0001, Ming Li 0001, Bin Ma 0002	Optimizing Multiple Spaced Seeds for Homology Search.	CPM	2004	DBLP DOI BibTeX RDF
1	Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg	Multi-seed Lossless Filtration (Extended Abstract).	CPM	2004	DBLP DOI BibTeX RDF
1	Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal Ziv-Ukelson	Approximate Labelled Subtree Homeomorphism.	CPM	2004	DBLP DOI BibTeX RDF
1	Trinh N. D. Huynh, Wing-Kai Hon, Tak Wah Lam, Wing-Kin Sung	Approximate String Matching Using Compressed Suffix Arrays.	CPM	2004	DBLP DOI BibTeX RDF
1	Rolf Backofen, Anke Busch	Computational Design of New and Recombinant Selenoproteins.	CPM	2004	DBLP DOI BibTeX RDF
1	Miklós Csürös	Performing Local Similarity Searches with Variable Length Seeds.	CPM	2004	DBLP DOI BibTeX RDF
1	Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Yang	Finding Biclusters by Random Projections.	CPM	2004	DBLP DOI BibTeX RDF
1	Vincent Berry, François Nicolas	Maximum Agreement and Compatible Supertrees (Extended Abstract).	CPM	2004	DBLP DOI BibTeX RDF
1	Thomas Schmidt 0001, Jens Stoye	Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences.	CPM	2004	DBLP DOI BibTeX RDF
1	Anne Bergeron, Julia Mixtacki, Jens Stoye	Reversal Distance without Hurdles and Fortresses.	CPM	2004	DBLP DOI BibTeX RDF
1	Firas Swidan, Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter	Sorting by Length-Weighted Reversals: Dealing with Signs and Circularity.	CPM	2004	DBLP DOI BibTeX RDF
1	Michel Habib, Christophe Paul, Mathieu Raffinot	Maximal Common Connected Sets of Interval Graphs.	CPM	2004	DBLP DOI BibTeX RDF
1	Eugene Davydov, Serafim Batzoglou	A Computational Model for RNA Multiple Structural Alignment..	CPM	2004	DBLP DOI BibTeX RDF
1	Yishan Jiao, Jingyi Xu, Ming Li	On the k-Closest Substring and k-Consensus Pattern Problems.	CPM	2004	DBLP DOI BibTeX RDF
1	Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang 0002	The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.	CPM	2004	DBLP DOI BibTeX RDF
1	Nikhil Bansal 0001, Mark Cieliebak, Zsuzsanna Lipták	Efficient Algorithms for Finding Submasses in Weighted Strings.	CPM	2004	DBLP DOI BibTeX RDF
1	Vicky Choi, Navin Goyal	A Combinatorial Shape Matching Algorithm for Rigid Protein Docking.	CPM	2004	DBLP DOI BibTeX RDF
1	Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu	Small Phylogeny Problem: Character Evolution Trees.	CPM	2004	DBLP DOI BibTeX RDF
1	Jari Kytöjoki, Leena Salmela, Jorma Tarhio	Tuning String Matching for Huge Pattern Sets.	CPM	2003	DBLP DOI BibTeX RDF
1	Maria Emília Telles Walter, Luiz Reginaldo A. F. Curado, Adilton G. Oliveira	Working on the Problem of Sorting by Transpositions on Genome Rearrangements.	CPM	2003	DBLP DOI BibTeX RDF
1	Mohamed Ibrahim Abouelhoda, Enno Ohlebusch	Multiple Genome Alignment: Chaining Algorithms Revisited.	CPM	2003	DBLP DOI BibTeX RDF
1	Dan Gusfield	Haplotype Inference by Pure Parsimony.	CPM	2003	DBLP DOI BibTeX RDF
1	Hiroshi Sakamoto	A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression.	CPM	2003	DBLP DOI BibTeX RDF
1	Gad M. Landau, Baruch Schieber, Michal Ziv-Ukelson	Sparse LCS Common Substring Alignment.	CPM	2003	DBLP DOI BibTeX RDF
1	Olivier Elemento, Olivier Gascuel	An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees.	CPM	2003	DBLP DOI BibTeX RDF
1	Gabriel Valiente	Constrained Tree Inclusion.	CPM	2003	DBLP DOI BibTeX RDF	Tree inclusion, subtree homeomorphism, noncrossing bipartite matching, tree pattern matching
1	Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park	Linear-Time Construction of Suffix Arrays.	CPM	2003	DBLP DOI BibTeX RDF
1	Behshad Behzadi, Jean-Marc Steyaert	An Improved Algorithm for Generalized Comparison of Minisatellites.	CPM	2003	DBLP DOI BibTeX RDF
1	Raffaele Giancarlo, Marinella Sciortino	Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms.	CPM	2003	DBLP DOI BibTeX RDF
1	Jie Zheng 0002, Timothy J. Close, Tao Jiang 0001, Stefano Lonardi	Efficient Selection of Unique and Popular Oligos for Large EST Databases.	CPM	2003	DBLP DOI BibTeX RDF
1	Serge Dulucq, Hélène Touzet	Analysis of Tree Edit Distance Algorithms.	CPM	2003	DBLP DOI BibTeX RDF
1	Tzvika Hartman	A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions.	CPM	2003	DBLP DOI BibTeX RDF
1	Giancarlo Mauri, Giulio Pavesi	Pattern Discovery in RNA Secondary Structure Using Affix Trees.	CPM	2003	DBLP DOI BibTeX RDF
1	Haim Kaplan, Elad Verbin	Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals.	CPM	2003	DBLP DOI BibTeX RDF
1	Kjell Lemström, Veli Mäkinen	On Minimizing Pattern Splitting in Multi-track String Matching.	CPM	2003	DBLP DOI BibTeX RDF
1	Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps	Two-Dimensional Pattern Matching with Rotations.	CPM	2003	DBLP DOI BibTeX RDF	two-dimensional pattern matching, rotation, Design and analysis of algorithms
1	Ricardo A. Baeza-Yates, Edgar Chávez, Maxime Crochemore (eds.)	Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings	CPM	2003	DBLP DOI BibTeX RDF
1	Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre	Extracting Approximate Patterns.	CPM	2003	DBLP DOI BibTeX RDF
1	Bin Ma 0002, Zhuozhi Wang, Kaizhong Zhang	Alignment between Two Multiple Alignments.	CPM	2003	DBLP DOI BibTeX RDF
1	Bin Ma 0002, Kaizhong Zhang, Chengzhi Liang	An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum.	CPM	2003	DBLP DOI BibTeX RDF
1	Kimmo Fredriksson, Gonzalo Navarro 0001	Average-Optimal Multiple Approximate String Matching.	CPM	2003	DBLP DOI BibTeX RDF
1	Brona Brejová, Daniel G. Brown 0001, Tomás Vinar	Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions.	CPM	2003	DBLP DOI BibTeX RDF
1	Stefan Burkhardt, Juha Kärkkäinen	Fast Lightweight Suffix Array Construction and Checking.	CPM	2003	DBLP DOI BibTeX RDF
1	Pang Ko, Srinivas Aluru	Space Efficient Linear Time Construction of Suffix Arrays.	CPM	2003	DBLP DOI BibTeX RDF
1	Raphaël Clifford, Marek J. Sergot	Distributed and Paged Suffix Trees for Large Genetic Databases.	CPM	2003	DBLP DOI BibTeX RDF
1	François Nicolas, Eric Rivals	Complexities of the Centre and Median String Problems.	CPM	2003	DBLP DOI BibTeX RDF
1	Nadia Nedjah, Luiza de Macedo Mourelle	More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs.	CPM	2003	DBLP DOI BibTeX RDF
1	Brona Brejová, Tomás Vinar	A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding.	CPM	2002	DBLP DOI BibTeX RDF	length distribution, hidden Markov models, computational biology, gene finding
1	Wojciech Rytter	Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression.	CPM	2002	DBLP DOI BibTeX RDF	LZ-compression, minimal grammar, AVL-grammar, AVL-tree
1	Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter	Three Heuristics for delta-Matching: delta-BM Algorithms.	CPM	2002	DBLP DOI BibTeX RDF
1	Stéphane Vialette	Pattern Matching Problems over 2-Interval Sets.	CPM	2002	DBLP DOI BibTeX RDF
1	Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas	Identifying Occurrences of Maximal Pairs in Multiple Strings.	CPM	2002	DBLP DOI BibTeX RDF	DNA Matching, Search Trees, String Algorithms
1	Hiroki Arimura	Efficient Text Mining with Optimized Pattern Discovery.	CPM	2002	DBLP DOI BibTeX RDF
1	Jochen Alber, Jens Gramm, Jiong Guo, Rolf Niedermeier	Towards Optimally Solving the LONGEST COMMON SUBSEQUENCE Problem for Sequences with Nested Arc Annotations in Linear Time.	CPM	2002	DBLP DOI BibTeX RDF
1	Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott	On the Complexity of Deriving Position Specific Score Matrices from Examples.	CPM	2002	DBLP DOI BibTeX RDF
1	Veli Mäkinen, Esko Ukkonen	Local Similarity Based Point-Pattern Matching.	CPM	2002	DBLP DOI BibTeX RDF
1	Heikki Hyyrö, Gonzalo Navarro 0001	Faster Bit-Parallel Approximate String Matching.	CPM	2002	DBLP DOI BibTeX RDF
1	S. Muthukrishnan 0001, Süleyman Cenk Sahinalp	Simple and Practical Sequence Nearest Neighbors with Block Operations.	CPM	2002	DBLP DOI BibTeX RDF
1	Lucian Ilie, Sheng Yu 0001	Constructing NFA s by Optimal Use of Positions in Regular Expressions.	CPM	2002	DBLP DOI BibTeX RDF	right-invariant equivalence, $varepsilon$-elimination, algorithms, regular expressions, positions, partial derivatives, quotients, regular expression matching, nondeterministic finite automata
1	Dana Shapira, James A. Storer	Edit Distance with Move Operations.	CPM	2002	DBLP DOI BibTeX RDF
1	Stefan Burkhardt, Juha Kärkkäinen	One-Gapped q-Gram Filtersfor Levenshtein Distance.	CPM	2002	DBLP DOI BibTeX RDF
1	Wing-Kai Hon, Kunihiko Sadakane	Space-Economical Algorithms for Finding Maximal Unique Matches.	CPM	2002	DBLP DOI BibTeX RDF
1	Venkatesan T. Chakaravarthy, Rajasekar Krishnamurthy	The Problem of Context Sensitive String Matching.	CPM	2002	DBLP DOI BibTeX RDF
1	Raymond Wan 0001, Alistair Moffat	Block Merging for Off-Line Compression.	CPM	2002	DBLP DOI BibTeX RDF
1	Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa	The Minimum DAWG for All Suffixes of a String and Its Applications.	CPM	2002	DBLP DOI BibTeX RDF
1	Alberto Apostolico, Masayuki Takeda (eds.)	Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings	CPM	2002	DBLP DOI BibTeX RDF
1	Jussi Rautio, Jani Tanninen, Jorma Tarhio	String Matching with Stopper Encoding and Code Splitting.	CPM	2002	DBLP DOI BibTeX RDF
1	Frantisek Franek, Jiandong Jiang, Weilin Lu, William F. Smyth	Two-Pattern Strings.	CPM	2002	DBLP DOI BibTeX RDF
1	Jun Ogasawara, Shinichi Morishita	Practical Software for Aligning ESTs to Human Genome.	CPM	2002	DBLP DOI BibTeX RDF
1	Kimmo Fredriksson, Gonzalo Navarro 0001, Esko Ukkonen	Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations.	CPM	2002	DBLP DOI BibTeX RDF
1	Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün	Statistical Identification of Uniformly Mutated Segments within Repeats.	CPM	2002	DBLP DOI BibTeX RDF

Publications at "CPM"( http://dblp.L3S.de/Venues/CPM )