Combinatorial Pattern Matching: Third Annual Symposium, Tucson, Arizona, USA, April 29-May 1, 1992 : Proceedings"This volume contains the 22 papers accepted for presentation at the Third Annual Symposium on Combinatorial Pattern Matching held April 29 to May 1, 1992, in Tucson, Arizona; it constitutes the first conference proceedings entirely devoted to combinatorial pattern matching (CPM). CPM deals withissues of searching and matching of strings and other more complicated patterns such as trees, regular expressions, extended expressions, etc. in order to derive combinatorial properties for such structures. As an interdisciplinary field of growing interest, CPM is related to research in information retrieval, pattern recognition, compilers, data compression, and program analysis as well as to results, problems and methods from combinatorial mathematics and molecular biology."--PUBLISHER'S WEBSITE. |
From inside the book
Results 1-3 of 28
Page 73
... point between those candidates in E ( labeled " midpoint " in the figure ) , and then finding the left and right intersection points between the new candidate and E. Finding each intersection point involves a two step binary search ...
... point between those candidates in E ( labeled " midpoint " in the figure ) , and then finding the left and right intersection points between the new candidate and E. Finding each intersection point involves a two step binary search ...
Page 139
... points , which correspond to atoms . Each point may have a label ( = name of an atom ) . Additional relations between points ( links ) may be defined . The structure comparison problem can be stated as follows . Given the 3 - D coor ...
... points , which correspond to atoms . Each point may have a label ( = name of an atom ) . Additional relations between points ( links ) may be defined . The structure comparison problem can be stated as follows . Given the 3 - D coor ...
Page 141
... point ' sets . Motion Invariant Representation . Let us assume for the moment that our ' in- terest points ' have no special salient features , except their spatial location . If the points were colored , each by a different color , one ...
... point ' sets . Motion Invariant Representation . Let us assume for the moment that our ' in- terest points ' have no special salient features , except their spatial location . If the points were colored , each by a different color , one ...
Contents
A Language Approach to String Searching Evaluation | 15 |
Fast Multiple Keyword Searching | 41 |
Approximate Regular Expression Pattern Matching with | 67 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
alphabet approximate string matching arithmetic coding atoms automaton b-suffix bound C₁ candidate character circular strings CNNFA compact suffix tree comparison complexity Computer Science construction corresponding data compression data structure de(v defined deletion denote diagonal dictionary matching displayable entities dynamic programming edit distance efficient Euler Tour extension edge function Galil genes genomes given graph hashing I-forest implemented input strings insertion integer label leaf Lemma length longest common subsequence matching algorithm matching problem matrix McNaughton and Yamada's method Mm,n molecule motif multiple alignment MYNNFA n-gram NNFA node noncompact suffix trees nonperiodic O(kn O(log occurs operations optimal pair parse path pattern matching position prefix preprocessing probability Proof proteins random regular expression represents root running score sequence solve space substring subtree suffix tree symbol Theorem tree inclusion tree pattern matching trie values vertex Vishkin weight Yamada's NFA