Search results for "CPM"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Lars Arvestad	Aligning Coding DNA in the Presence of Frame-Shift Errors.	CPM	1997	DBLP DOI BibTeX RDF
1	Stefan Kurtz, Gene Myers	Estimating the Probability of Approximate Matches.	CPM	1997	DBLP DOI BibTeX RDF
1	Ting Chen, Steven Skiena	Trie-Based Data Structures for Sequence Assembly.	CPM	1997	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Piotr Indyk, Piotr Krysta	External Inverse Pattern Matching.	CPM	1997	DBLP DOI BibTeX RDF
1	Aviezri S. Fraenkel, Jamie Simpson, Mike Paterson	On Weak Circular Squares in Binary Words.	CPM	1997	DBLP DOI BibTeX RDF
1	Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter	On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts.	CPM	1997	DBLP DOI BibTeX RDF
1	Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi 0001	Banishing Bias from Consensus Sequences.	CPM	1997	DBLP DOI BibTeX RDF
1	Shmuel T. Klein	Space- and Time-Efficient Decoding with Canonical Huffman Trees.	CPM	1997	DBLP DOI BibTeX RDF
1	Andreas W. M. Dress	Iterative versus simultaneous Multiple Sequence Alignment (Abstract).	CPM	1997	DBLP DOI BibTeX RDF
1	Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda	An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs.	CPM	1997	DBLP DOI BibTeX RDF
1	Thorsten Richter	A New Algorithm for the Ordered Tree Inclusion Problem.	CPM	1997	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Renaud Vérin	Direct Construction of Compact Directed Acyclic Word Graphs.	CPM	1997	DBLP DOI BibTeX RDF
1	Saïd Abdeddaïm	On Incremental Computation of Transitive Closure and Greedy Alignment.	CPM	1997	DBLP DOI BibTeX RDF
1	Marie-France Sagot, Alain Viari	Flexible Identification of Structural Objects in Nucleic Acid Sequences: Palindromes, Mirror Repeats, Pseudoknots and Triple Helices.	CPM	1997	DBLP DOI BibTeX RDF
1	Alberto Apostolico, Jotun Hein (eds.)	Combinatorial Pattern Matching, 8th Annual Symposium, CPM 97, Aarhus, Denmark, June 30 - July 2, 1997, Proceedings	CPM	1997	DBLP DOI BibTeX RDF
1	David Sankoff, Marie-Noelle Parent, Isabelle Marchand, Vincent Ferretti	On the Nadeau-Taylor Theory of Conserved Chromosome Segments.	CPM	1997	DBLP DOI BibTeX RDF
1	Mary Cryan, Leslie Ann Goldberg, Cynthia A. Phillips	Approximation Algorithms for the Fixed-Topology Phylogenetic Number Problem.	CPM	1997	DBLP DOI BibTeX RDF
1	Gonzalo Navarro 0001, Joao Paulo Kitajima, Berthier A. Ribeiro-Neto, Nivio Ziviani	Distributed Generation of Suffix Arrays.	CPM	1997	DBLP DOI BibTeX RDF
1	Enno Ohlebusch	A Filter Method for the Weighted Local Similarity Search Problem.	CPM	1997	DBLP DOI BibTeX RDF
1	Jee-Soo Lee, Dong Kyue Kim, Kunsoo Park, Yookun Cho	Efficient Algorithms for Approximate String Matching with Swaps (Extended Abstract).	CPM	1997	DBLP DOI BibTeX RDF
1	Nicholas Q. Trân	An Easy Case of Sorting by Reversals.	CPM	1997	DBLP DOI BibTeX RDF
1	Joseph B. Kruskal	Modern Comparative Lexicostatistics.	CPM	1997	DBLP DOI BibTeX RDF
1	Gautam Das 0001, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen	Episode Matching.	CPM	1997	DBLP DOI BibTeX RDF
1	Kunsoo Park	Analysis of Two-Dimensional Approximate Pattern Matching Algorithms.	CPM	1996	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans	Finite-State Computability of Annotations of Strings and Trees.	CPM	1996	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Leszek Gasieniec	Approximate Dictionary Queries.	CPM	1996	DBLP DOI BibTeX RDF
1	Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling	Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem.	CPM	1996	DBLP DOI BibTeX RDF
1	William E. Hart, Sorin Istrail	Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract).	CPM	1996	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates, Gonzalo Navarro 0001	A Faster Algorithm for Approximate String Matching.	CPM	1996	DBLP DOI BibTeX RDF
1	Chris Armen, Clifford Stein 0001	A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem.	CPM	1996	DBLP DOI BibTeX RDF
1	Vincent Ferretti, Joseph H. Nadeau, David Sankoff	Original Synteny.	CPM	1996	DBLP DOI BibTeX RDF
1	Lusheng Wang, Dan Gusfield	Improved Approximation Algorithms for Tree Alignment.	CPM	1996	DBLP DOI BibTeX RDF
1	Dany Breslauer	The suffix Tree of a Tree and Minimizing Sequential Transducers.	CPM	1996	DBLP DOI BibTeX RDF
1	Amihood Amir, Gruia Calinescu	Alphabet Independent and Dictionary Scaled Matching.	CPM	1996	DBLP DOI BibTeX RDF
1	Mikhail S. Gelfand, Andrey A. Mironov, Pavel A. Pevzner	Spliced Alignment: A New Approach to Gene Recognition.	CPM	1996	DBLP DOI BibTeX RDF
1	David J. Lipman	Computing Discoveries in Molecular Biology (Abstract).	CPM	1996	DBLP DOI BibTeX RDF
1	Daniel S. Hirschberg, Eugene W. Myers (eds.)	Combinatorial Pattern Matching, 7th Annual Symposium, CPM 96, Laguna Beach, California, USA, June 10-12, 1996, Proceedings	CPM	1996	DBLP DOI BibTeX RDF
1	Srinivasa Rao Arikati, Anders Dessmark, Andrzej Lingas, Madhav V. Marathe	Approximation Algorithms for Maximum Two-Dimensional Pattern Matching.	CPM	1996	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter	Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).	CPM	1996	DBLP DOI BibTeX RDF
1	Richard Arratia, Gesine Reinert	Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization.	CPM	1996	DBLP DOI BibTeX RDF
1	Robert Muth, Udi Manber	Approximate Multiple Strings Search.	CPM	1996	DBLP DOI BibTeX RDF
1	Kaizhong Zhang	Efficient Parallel Algorithms for Tree Editing Problems.	CPM	1996	DBLP DOI BibTeX RDF
1	Cynthia A. Phillips, Tandy J. Warnow	The Asymmetric Median Tree - A New model for Building Consensus Trees.	CPM	1996	DBLP DOI BibTeX RDF
1	Nadia El-Mabrouk, Maxime Crochemore	Boyer-Moore Strategy to Efficient Approximate String Matching.	CPM	1996	DBLP DOI BibTeX RDF
1	Bilha Sandak, Ruth Nussinov, Haim J. Wolfson	Docking of Conformationally Flexible Proteins.	CPM	1996	DBLP DOI BibTeX RDF
1	Martin Farach, S. Muthukrishnan 0001	Perfect Hashing for Strings: Formalization and Algorithms.	CPM	1996	DBLP DOI BibTeX RDF
1	Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Gregory B. Sorkin	Constructing Computer Virus Phylogenies.	CPM	1996	DBLP DOI BibTeX RDF
1	James Jianghai Fu	Approximate Pattern Matching in Directed Graphs.	CPM	1996	DBLP DOI BibTeX RDF
1	Piotr Berman, Sridhar Hannenhalli	Fast Sorting by Reversal.	CPM	1996	DBLP DOI BibTeX RDF
1	Marie-France Sagot, Alain Viari	A Double Combinatorial Approach to Discovering Patterns in Biological Sequences.	CPM	1996	DBLP DOI BibTeX RDF
1	Erkki Sutinen, Jorma Tarhio	Filtration with q-Samples in Approximate String Matching.	CPM	1996	DBLP DOI BibTeX RDF
1	Arne Andersson, N. Jesper Larsson, Kurt Swanson	Suffix Trees on Words.	CPM	1996	DBLP DOI BibTeX RDF
1	Gregory Kucherov, Michaël Rusinowitch	Matching a Set of Strings with Variable Length Don't Cares.	CPM	1995	DBLP DOI BibTeX RDF
1	Juha Kärkkäinen	Suffix Cactus: A Cross between Suffix Tree and Suffix Array.	CPM	1995	DBLP DOI BibTeX RDF
1	Archie L. Cobbs	Fast Approximate Matching using Suffix Trees.	CPM	1995	DBLP DOI BibTeX RDF
1	Vineet Bafna, S. Muthukrishnan 0001, R. Ravi 0001	Computing Similarity between RNA Strings.	CPM	1995	DBLP DOI BibTeX RDF
1	Kunsoo Park, Dong Kyue Kim	String Matching in Hypertext.	CPM	1995	DBLP DOI BibTeX RDF
1	Marie-France Sagot, Alain Viari, Henry Soldano	Multiple Sequence Comparison: A Peptide Matching Approach.	CPM	1995	DBLP DOI BibTeX RDF
1	Vlado Dancík	Common Subsequences and Supersequences and Their expected Length.	CPM	1995	DBLP DOI BibTeX RDF
1	Kaizhong Zhang, Jason Tsong-Li Wang, Dennis E. Shasha	On the Editing Distance between Undirected Acyclic Graphs and Related Problems.	CPM	1995	DBLP DOI BibTeX RDF
1	Sridhar Hannenhalli	Polynomial-time Algorithm for Computing Translocation Distance between Genomes.	CPM	1995	DBLP DOI BibTeX RDF
1	Raffaele Giancarlo, Roberto Grossi	Multi-Dimensional Pattern Matching with Dimensional Wildcards.	CPM	1995	DBLP DOI BibTeX RDF
1	Claus Rick	A New Flexible Algorithm for the Longest Common Subsequence Problem.	CPM	1995	DBLP DOI BibTeX RDF
1	Lukas Knecht	Pairwise Alignment with Scoring on Tuples.	CPM	1995	DBLP DOI BibTeX RDF
1	Arthur M. Lesk	Three-Dimensional Pattern Matching in Protein Structure Analysis.	CPM	1995	DBLP DOI BibTeX RDF
1	Jianghai Fu	Pattern Matching in Directed Graphs.	CPM	1995	DBLP DOI BibTeX RDF
1	Leslie Ann Goldberg, Paul W. Goldberg, Cynthia A. Phillips, Elizabeth Sweedyk, Tandy J. Warnow	Minimizing Phylogenetic Number to find Good Evolutionary Trees.	CPM	1995	DBLP DOI BibTeX RDF
1	Uzi Vishkin	On a Technique for Parsing a String (Abstract).	CPM	1995	DBLP DOI BibTeX RDF
1	Zvi Galil, Esko Ukkonen (eds.)	Combinatorial Pattern Matching, 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995, Proceedings	CPM	1995	DBLP DOI BibTeX RDF
1	Liz Hanks, Ron Cytron, Will D. Gillett	An Efficient Algorithm for Developing Topological Valid Matchings.	CPM	1995	DBLP DOI BibTeX RDF
1	Mehryar Mohri	Matching Patterns of An Automaton.	CPM	1995	DBLP DOI BibTeX RDF
1	R. Ravi 0001, John D. Kececioglu	Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree.	CPM	1995	DBLP DOI BibTeX RDF
1	S. Muthukrishnan 0001	New Results and Open Problems Related to Non-Standard Stringology.	CPM	1995	DBLP DOI BibTeX RDF
1	Craig J. Benham, Sampath Kannan, Tandy J. Warnow	Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibility.	CPM	1995	DBLP DOI BibTeX RDF
1	Hans-Werner Mewes, Klaus Heumann	Genome Analysis: Pattern Search in Biological Macromolecules.	CPM	1995	DBLP DOI BibTeX RDF
1	Sandeep K. Gupta 0002, John D. Kececioglu, Alejandro A. Schäffer	Making the Shortest-Paths Approach to Sum-of-Pairs Multiple Sequence Alignment More Space Efficient in Practice (Extended Abstract).	CPM	1995	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter	Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling.	CPM	1995	DBLP DOI BibTeX RDF
1	Marek Karpinski, Wojciech Rytter, Ayumi Shinohara	Pattern-Matching for Strings with Short Descriptions.	CPM	1995	DBLP DOI BibTeX RDF
1	Jotun Hein, Tao Jiang 0001, Lusheng Wang 0001, Kaizhong Zhang	On the Complexity of Comparing Evolutionary Trees (Extended Abstract).	CPM	1995	DBLP DOI BibTeX RDF
1	Dany Breslauer, Leszek Gasieniec	Efficient String Matching on Coded Texts.	CPM	1995	DBLP DOI BibTeX RDF
1	Emmanuel Roche	Smaller Representations for Finite-State Transducers and Finite-State Automata.	CPM	1995	DBLP DOI BibTeX RDF
1	Andrew Chi-Chih Yao, F. Frances Yao	Dictionary Loop-Up with Small Errors.	CPM	1995	DBLP DOI BibTeX RDF
1	Gary Benson	A Space Efficient Algorithm for Finding the Best Non-Overlapping Alignment Score.	CPM	1994	DBLP DOI BibTeX RDF
1	Pekka Kilpeläinen, Heikki Mannila	Query Primitives for Tree-Structured Data.	CPM	1994	DBLP DOI BibTeX RDF
1	William I. Chang, Thomas G. Marr	Approximate String Matching and Local Similarity.	CPM	1994	DBLP DOI BibTeX RDF
1	Tatsuya Akutsu	Approximate String Matching with Don't Care Characters.	CPM	1994	DBLP DOI BibTeX RDF
1	Yasubumi Sakakibara, Michael Brown, Richard Hughey, I. Saira Mian, Kimmen Sjölander, Rebecca C. Underwood, David Haussler	Recent Methods for RNA Modeling Using Stochastic Context-Free Grammars.	CPM	1994	DBLP DOI BibTeX RDF
1	Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu	Proximity Matching Using Fixed-Queries Trees.	CPM	1994	DBLP DOI BibTeX RDF
1	Vineet Bafna, Eugene L. Lawler, Pavel A. Pevzner	Approximation Algorithms for Multiple Sequence Alignment.	CPM	1994	DBLP DOI BibTeX RDF
1	Ramana M. Idury, Alejandro A. Schäffer	Multiple Matching of Parameterized Patterns.	CPM	1994	DBLP DOI BibTeX RDF
1	Xiaoqiu Huang 0001	A Context Dependent Method for Comparing Sequences.	CPM	1994	DBLP DOI BibTeX RDF
1	Marek Karpinski, Wojciech Rytter	An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern.	CPM	1994	DBLP DOI BibTeX RDF
1	Dany Breslauer	Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries.	CPM	1994	DBLP DOI BibTeX RDF
1	Udi Manber	A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File.	CPM	1994	DBLP DOI BibTeX RDF
1	Tomasz Luczak 0001, Wojciech Szpankowski	A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms.	CPM	1994	DBLP DOI BibTeX RDF
1	Kenneth S. Alexander	Shortest Common Superstrings for Strings of Random Letters.	CPM	1994	DBLP DOI BibTeX RDF
1	Archie L. Cobbs	Fast Identification of Approximately Matching Substrings.	CPM	1994	DBLP DOI BibTeX RDF
1	John D. Kececioglu, David Sankoff	Efficient Bounds for Oriented Chromosome Inversion Distance.	CPM	1994	DBLP DOI BibTeX RDF
1	Robert W. Irving, Campbell Fraser	Maximal Common Subsequences and Minimal Common Supersequences.	CPM	1994	DBLP DOI BibTeX RDF
1	S. Rao Kosaraju	Computation of Squares in a String (Preliminary Version).	CPM	1994	DBLP DOI BibTeX RDF

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