1 option
Combinatorial Pattern Matching : 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings / edited by Amihood Amir, Gad M. Landau.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2089.
- Lecture Notes in Computer Science, 0302-9743 ; 2089
- Language:
- English
- Subjects (All):
- Pattern perception.
- Algorithms.
- Information storage and retrieval.
- Coding theory.
- Information theory.
- Combinatorial analysis.
- Pattern Recognition.
- Algorithm Analysis and Problem Complexity.
- Information Storage and Retrieval.
- Coding and Information Theory.
- Combinatorics.
- Local Subjects:
- Pattern Recognition.
- Algorithm Analysis and Problem Complexity.
- Information Storage and Retrieval.
- Coding and Information Theory.
- Combinatorics.
- Physical Description:
- 1 online resource (VIII, 280 pages).
- Edition:
- First edition 2001.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
- System Details:
- text file PDF
- 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 2 ) Space and Time
- 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
- Balanced Suffix Trees (Invited Lecture)
- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
- Minimum Quartet Inconsistency Is Fixed Parameter Tractable
- Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-48194-2
- 9783540481942
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.