Combinatorial pattern matching [electronic resource] : 12th annual symposium, CPM 2001, Jerusalem, Israel, Jul | CPM (Symposium) (12th : 2001 : Jerusalem), Amir, Amihood, Landau, Gad M
Share on TelegramCombinatorial pattern matching [electronic resource] : 12th annual symposium, CPM 2001, Jerusalem, Israel, Jul
Author: CPM (Symposium) (12th : 2001 : Jerusalem), Amir, Amihood, Landau, Gad M
Added by: sketch
Added Date: 2015-12-30
Publication Date: 2001
Language: eng
Subjects: Computer algorithms, Combinatorial analysis, Algorithmes, Analyse combinatoire, Informatique, Combinatorische meetkunde, Matching, Algoritmen, Patroonherkenning, Algoritmen More
Publishers: Berlin ; London : Springer
Collections: journals contributions, journals
ISBN Number: 9783540481942, 354048194X
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 131.67 MB
PDF Size: 3.67 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 526
Views: 576
Total Files: 18
Media Type: texts
Description
Author: Amihood Amir, Gad M. Landau
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42271-6
DOI: 10.1007/3-540-48194-X
Table of Contents:
- Regular Expression Searching over Ziv-Lempel Compressed Text
- Parallel Lempel Ziv Coding (Extended Abstract)
- Approximate Matching of Run-Length Compressed Strings
- What to Do with All this Hardware? (Invited Lecture)
- Efficient Experimental String Matching by Weak Factor Recognition*
- Better Filtering with Gapped q-Grams
- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract)
- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture)
- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
- Tandem Cyclic Alignment
- An Output-Sensitive Flexible Pattern Discovery Algorithm
- Episode Matching*
- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music
- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract)
- Computing the Equation Automaton of a Regular Expression in O(s
- On-Line Construction of Compact Directed Acyclic Word Graphs*
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
- Multiple Pattern Matching Algorithms on Collage System
- Finding All Common Intervals of k Permutations
- Generalized Pattern Matching and the Complexity of Unavoidability Testing
Includes bibliographical references and index
Print version record
This book constitutes the refereed proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001, held in Jerusalem, Israel, in July 2001. The 21 revised papers presented together with one invited paper were carefully reviewed and selected from 35 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays as well as to advanced applications of CPM in areas such as the Internet, computational biology, multimedia systems, information retrieval, data compression, coding, computer vision, and pattern recognition