Search results for "CPM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Laxmi Parida, Isidore Rigoutsos, Daniel E. Platt	An Output-Sensitive Flexible Pattern Discovery Algorithm.	CPM	2001	DBLP DOI BibTeX RDF
1	Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park	Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications.	CPM	2001	DBLP DOI BibTeX RDF
1	Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi	On-Line Construction of Compact Directed Acyclic Word Graphs.	CPM	2001	DBLP DOI BibTeX RDF
1	Hiroki Arimura, Hiroki Asaka, Hiroshi Sakamoto, Setsuo Arikawa	Efficient Discovery of Proximity Patterns with Suffix Arrays.	CPM	2001	DBLP DOI BibTeX RDF
1	Steffen Heber, Jens Stoye	Finding All Common Intervals of k Permutations.	CPM	2001	DBLP DOI BibTeX RDF
1	Anne Bergeron	A Very Elementary Presentation of the Hannenhalli-Pevzner Theory.	CPM	2001	DBLP DOI BibTeX RDF
1	Gary Benson	Tandem Cyclic Alignment.	CPM	2001	DBLP DOI BibTeX RDF
1	Aviezri S. Fraenkel, Jamie Simpson	An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture).	CPM	2001	DBLP DOI BibTeX RDF
1	Masayuki Takeda	String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music.	CPM	2001	DBLP DOI BibTeX RDF
1	Zdenek Tronícek	Episode Matching.	CPM	2001	DBLP DOI BibTeX RDF
1	Amihood Amir, Gad M. Landau (eds.)	Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings	CPM	2001	DBLP DOI BibTeX RDF
1	Abraham Bookstein, Shmuel T. Klein, Timo Raita	Fuzzy Hamming Distance: A New Dissimilarity Measure.	CPM	2001	DBLP DOI BibTeX RDF
1	Jean-Marc Champarnaud, Djelloul Ziadi	Computing the Equation Automaton of a Regular Expression in Space and Time.	CPM	2001	DBLP DOI BibTeX RDF
1	Christine E. Heitsch	Generalized Pattern Matching and the Complexity of Unavoidability Testing.	CPM	2001	DBLP DOI BibTeX RDF
1	Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot	Efficient Experimental String Matching by Weak Factor Recognition.	CPM	2001	DBLP DOI BibTeX RDF	information retrieval, string matching, algorithm design, Finite automaton
1	Gonzalo Navarro 0001	Regular Expression Searching over Ziv-Lempel Compressed Text.	CPM	2001	DBLP DOI BibTeX RDF
1	Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa	Multiple Pattern Matching Algorithms on Collage System.	CPM	2001	DBLP DOI BibTeX RDF
1	Jesper Jansson 0001, Andrzej Lingas	A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.	CPM	2001	DBLP DOI BibTeX RDF
1	S. Rao Kosaraju	Balanced Suffix Trees (Invited Lecture).	CPM	2001	DBLP DOI BibTeX RDF
1	Stefan Burkhardt, Juha Kärkkäinen	Better Filtering with Gapped q-Grams.	CPM	2001	DBLP DOI BibTeX RDF
1	Uzi Vishkin	What to Do with All this Hardware? (Invited Lecture).	CPM	2001	DBLP DOI BibTeX RDF
1	Veli Mäkinen, Gonzalo Navarro 0001, Esko Ukkonen	Approximate Matching of Run-Length Compressed Strings.	CPM	2001	DBLP DOI BibTeX RDF
1	Rolf Backofen, Sebastian Will	Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC.	CPM	2001	DBLP DOI BibTeX RDF
1	Jens Gramm, Rolf Niedermeier	Minimum Quartet Inconsistency Is Fixed Parameter Tractable.	CPM	2001	DBLP DOI BibTeX RDF
1	Shmuel Tomi Klein, Yair Wiseman	Parallel Lempel Ziv Coding.	CPM	2001	DBLP DOI BibTeX RDF
1	Gonzalo Navarro 0001, Jorma Tarhio	Boyer-Moore String Matching over Ziv-Lempel Compressed Text.	CPM	2000	DBLP DOI BibTeX RDF
1	Adam L. Buchsbaum, Raffaele Giancarlo	Algorithmic Aspects of Speech Recognition: A Synopsis.	CPM	2000	DBLP DOI BibTeX RDF
1	Bin Ma 0002	A Polynominal Time Approximation Scheme for the Closest Substring Problem.	CPM	2000	DBLP DOI BibTeX RDF
1	Steven Skiena, Pavel Sumazin	Shift Error Detection in Standardized Exams.	CPM	2000	DBLP DOI BibTeX RDF
1	Gonzalo Navarro 0001, Erkki Sutinen, Jani Tanninen, Jorma Tarhio	Indexing Text with Approximate q-Grams.	CPM	2000	DBLP DOI BibTeX RDF
1	David Bryant	A Lower Bound for the Breakpoint Phylogeny Problem.	CPM	2000	DBLP DOI BibTeX RDF
1	Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting	A Faster and Unifying Algorithm for Comparing Trees.	CPM	2000	DBLP DOI BibTeX RDF
1	Itsik Pe'er, Ron Shamir, Roded Sharan	Incomplete Directed Perfect Phylogeny.	CPM	2000	DBLP DOI BibTeX RDF
1	Shmuel T. Klein	Improving Static Compression Schemes by Alphabet Extension.	CPM	2000	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Christian N. S. Pedersen	Finding Maximal Quasiperiodicities in Strings.	CPM	2000	DBLP DOI BibTeX RDF
1	Paul Horton	Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment.	CPM	2000	DBLP DOI BibTeX RDF
1	Rolf Backofen	An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC).	CPM	2000	DBLP DOI BibTeX RDF
1	Veli Mäkinen	Compact Suffix Array.	CPM	2000	DBLP DOI BibTeX RDF
1	Moritz G. Maaß	Linear Bidirectional On-Line Construction of Affix Trees.	CPM	2000	DBLP DOI BibTeX RDF
1	Sung-Ryul Kim, Kunsoo Park	A Dynamic Edit Distance Table.	CPM	2000	DBLP DOI BibTeX RDF
1	Raffaele Giancarlo, David Sankoff (eds.)	Combinatorial Pattern Matching, 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings	CPM	2000	DBLP DOI BibTeX RDF
1	David Liben-Nowell, Jon M. Kleinberg	Structural Properties and Tractability Results for Linear Synteny.	CPM	2000	DBLP DOI BibTeX RDF
1	Matthew R. Nelson, Sharon L. R. Kardia, Charles F. Sing	The Combinatorial Partitioning Method.	CPM	2000	DBLP DOI BibTeX RDF
1	Laxmi Parida	Some Results on Flexible-Pattern Discovery.	CPM	2000	DBLP DOI BibTeX RDF
1	Fernando C. N. Pereira	Machine Learning for Efficient Natural-Language Processing.	CPM	2000	DBLP DOI BibTeX RDF
1	Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa	A Boyer-Moore Type Algorithm for Compressed Pattern Matching.	CPM	2000	DBLP DOI BibTeX RDF
1	Nadia El-Mabrouk	Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments.	CPM	2000	DBLP DOI BibTeX RDF
1	Juha Kärkkäinen, Gonzalo Navarro 0001, Esko Ukkonen	Approximate String Matching over Ziv-Lempel Compressed Text.	CPM	2000	DBLP DOI BibTeX RDF
1	Emily Rocke	Using Suffix Trees for Gapped Motif Discovery.	CPM	2000	DBLP DOI BibTeX RDF
1	Tao Jiang 0001, Guohui Lin, Bin Ma 0002, Kaizhong Zhang	The Longest Common Subsequence Problem for Arc-Annotated Sequences.	CPM	2000	DBLP DOI BibTeX RDF	Sequence annotation, approximation algorithm, dynamic programming, longest common subsequence, maximum independent set, MAX SNP-hard
1	Leszek Gasieniec, Jesper Jansson 0001, Andrzej Lingas	Approximation Algorithms for Hamming Clustering Problems.	CPM	2000	DBLP DOI BibTeX RDF
1	Cyril Allauzen, Mathieu Raffinot	Simple Optimal String Matching Algorithm.	CPM	2000	DBLP DOI BibTeX RDF
1	Andrei Z. Broder	Identifying and Filtering Near-Duplicate Documents.	CPM	2000	DBLP DOI BibTeX RDF
1	Artur Czumaj, Leszek Gasieniec	On the Complexity of Determining the Period of a String.	CPM	2000	DBLP DOI BibTeX RDF
1	Mireille Régnier, Laurent Mouchard	Periods and Quasiperiods Characterization.	CPM	2000	DBLP DOI BibTeX RDF
1	Ian H. Witten	Browsing around a Digital Library: Today and Tomorrow.	CPM	2000	DBLP DOI BibTeX RDF
1	Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri	Approximating the Maximum Isomorphic Agreement Subtree Is Hard.	CPM	2000	DBLP DOI BibTeX RDF
1	David Fernández-Baca, Timo Seppäläinen, Giora Slutzki	Parametric Multiple Sequence Alignment and Phylogeny Construction.	CPM	2000	DBLP DOI BibTeX RDF
1	Sven Rahmann, Eric Rivals	Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts.	CPM	2000	DBLP DOI BibTeX RDF
1	Robert Giegerich	Explaining and Controlling Ambiguity in Dynamic Programming.	CPM	2000	DBLP DOI BibTeX RDF
1	Amir Ben-Dor, Itsik Pe'er, Ron Shamir, Roded Sharan	On the Complexity of Positional Sequencing by Hybridization.	CPM	1999	DBLP DOI BibTeX RDF
1	Kaizhong Zhang, Lusheng Wang 0001, Bin Ma 0002	Computing Similarity between RNA Structures.	CPM	1999	DBLP DOI BibTeX RDF
1	Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter	The Compression of Subsegments of Images Described by Finite Automata.	CPM	1999	DBLP DOI BibTeX RDF
1	Patricia A. Evans	Finding Common Subsequences with Arcs and Pseudoknots.	CPM	1999	DBLP DOI BibTeX RDF
1	Giuseppe Lancia, R. Ravi 0001	GESTALT: Genomic Steiner Alignments.	CPM	1999	DBLP DOI BibTeX RDF
1	Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa	Shift-And Approach to Pattern Matching in LZW Compressed Text.	CPM	1999	DBLP DOI BibTeX RDF
1	Nadia El-Mabrouk, David Sankoff	Hybridization and Genome Rearrangement.	CPM	1999	DBLP DOI BibTeX RDF
1	Hidetoshi Yokoo	A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes.	CPM	1999	DBLP DOI BibTeX RDF
1	Gonzalo Navarro 0001, Mathieu Raffinot	A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text.	CPM	1999	DBLP DOI BibTeX RDF
1	Zhuozhi Wang, Kaizhong Zhang	Finding Common RNA Secondary Structures from RNA Sequences.	CPM	1999	DBLP DOI BibTeX RDF
1	Daniel S. Hirschberg	Bounds on the Number of String Subsequences.	CPM	1999	DBLP DOI BibTeX RDF
1	David Liben-Nowell	On the Structure of Syntenic Distance.	CPM	1999	DBLP DOI BibTeX RDF
1	Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth	Approximate Periods of Strings.	CPM	1999	DBLP DOI BibTeX RDF
1	Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa	Pattern Matching in Text Compressed by Using Antidictionaries.	CPM	1999	DBLP DOI BibTeX RDF
1	Gonzalo Navarro 0001, Ricardo A. Baeza-Yates	A New Indexing Method for Approximate String Matching.	CPM	1999	DBLP DOI BibTeX RDF
1	Carola Wenk	Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology.	CPM	1999	DBLP DOI BibTeX RDF
1	Tatsuya Akutsu, Kyotetsu Kanaya, Akira Ohyama, Asao Fujiyama	Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions.	CPM	1999	DBLP DOI BibTeX RDF
1	Serafim Batzoglou, Sorin Istrail	Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem.	CPM	1999	DBLP DOI BibTeX RDF
1	Gonzalo Navarro 0001, Ricardo A. Baeza-Yates	Fast Multi-dimensional Approximate Pattern Matching.	CPM	1999	DBLP DOI BibTeX RDF
1	Strahil Ristov, Éric Laporte 0001	Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays.	CPM	1999	DBLP DOI BibTeX RDF
1	Maxime Crochemore, Mike Paterson (eds.)	Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, Proceedings	CPM	1999	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye	Finding Maximal Pairs with Bounded Gap.	CPM	1999	DBLP DOI BibTeX RDF
1	Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein	Efficient Special Cases of Pattern Matching with Swaps.	CPM	1998	DBLP DOI BibTeX RDF
1	Dong Kyue Kim, Yoo Ah Kim, Kunsoo Park	Constructing Suffix Arrays for Multi-dimensional Matrices.	CPM	1998	DBLP DOI BibTeX RDF
1	Jens Stoye, Dan Gusfield	Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version).	CPM	1998	DBLP DOI BibTeX RDF
1	Martin Farach-Colton (eds.)	Combinatorial Pattern Matching, 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings	CPM	1998	DBLP DOI BibTeX RDF
1	Kaizhong Zhang	Efficient Parallel Algorithm for the Editing Distance between Ordered Trees.	CPM	1998	DBLP DOI BibTeX RDF
1	John D. Kececioglu, Weiqing Zhang	Aligning Alignments.	CPM	1998	DBLP DOI BibTeX RDF
1	Christian Charras, Thierry Lecroq, Joseph Daniel Pehoushek	A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract).	CPM	1998	DBLP DOI BibTeX RDF
1	Knut Magne Risvik	Approximate Word Sequence Matching over Sparse Suffix Trees.	CPM	1998	DBLP DOI BibTeX RDF
1	Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff	Genome Halving.	CPM	1998	DBLP DOI BibTeX RDF
1	Gene Myers	A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming.	CPM	1998	DBLP DOI BibTeX RDF
1	Bin Ma 0002, Lusheng Wang 0001, Ming Li 0001	Fixed Topology Alignment with Recombination.	CPM	1998	DBLP DOI BibTeX RDF
1	Christian N. S. Pedersen, Rune B. Lyngsø, Jotun Hein	Comparison of Coding DNA.	CPM	1998	DBLP DOI BibTeX RDF
1	Eugene W. Myers, Paulo Oliva, Katia S. Guimarães	Reporting Exact and Approximate Regular Expression Matches.	CPM	1998	DBLP DOI BibTeX RDF
1	Gonzalo Navarro 0001, Mathieu Raffinot	A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching.	CPM	1998	DBLP DOI BibTeX RDF
1	Michal Ziv-Ukelson, Aaron Kershenbaum	A Dictionary Matching Algorithm Fast on the Average for Terms of Varying Length.	CPM	1998	DBLP DOI BibTeX RDF
1	Kimmo Fredriksson, Esko Ukkonen	A Rotation Invariant Filter for Two-Dimensional String Matching.	CPM	1998	DBLP DOI BibTeX RDF
1	Yanling Yang, Kaizhong Zhang, Xiong Wang, Jason Tsong-Li Wang, Dennis E. Shasha	An Approximate Oracle for Distance in Metric Spaces.	CPM	1998	DBLP DOI BibTeX RDF
1	Yufang Hua, Tao Jiang 0001, Bin Wu	Aligning DNA Sequences to Minimize the Change in Protein (Extended Abstract).	CPM	1998	DBLP DOI BibTeX RDF

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