Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 84
Page 132
... tree is a canonical PQ tree . Some PQ trees are given special names : Given a finite set X , the PQ tree consisting of a single P node with [ X ] children that are all leaves is called the universal PQ tree . We denote the universal tree ...
... tree is a canonical PQ tree . Some PQ trees are given special names : Given a finite set X , the PQ tree consisting of a single P node with [ X ] children that are all leaves is called the universal PQ tree . We denote the universal tree ...
Page 133
... tree T in Figure 1 is the one that best describes these appearances . However , edcba E C ( T ) although the pattern never appeared as edcba . On the other hand , notice that the universal PQ tree over Σ , Tu , is such that { 1 , 2 ...
... tree T in Figure 1 is the one that best describes these appearances . However , edcba E C ( T ) although the pattern never appeared as edcba . On the other hand , notice that the universal PQ tree over Σ , Tu , is such that { 1 , 2 ...
Page 347
... tree s by replacing variables having labels " x " , " y " and " z " with appropriate trees . In this paper , we introduce a new kind of variables , called height - constrained vari- ables ( abbreviated to HC - variables ) , in order to ...
... tree s by replacing variables having labels " x " , " y " and " z " with appropriate trees . In this paper , we introduce a new kind of variables , called height - constrained vari- ables ( abbreviated to HC - variables ) , in order to ...
Contents
Sharper Upper and Lower Bounds for an Approximation Scheme | 1 |
Text Indexing with Errors | 21 |
Succinct Suffix Arrays Based on RunLength Encoding | 45 |
Copyright | |
20 other sections not shown
Other editions - View all
Common terms and phrases
algorithm alignment alphabet Apostolico approximate automaton Bioinformatics bits bound breakpoint Burrows-Wheeler transform c-token character column complexity Computer Science consensus PQ tree consider constraints construction Corasick corresponding Crochemore data structure defined Definition denote DFTDP DIST DNA sequences dynamic programming edges edit distance efficient encoding errors example exons function gene genome given graph Hamming distance implementation input integer interval label Lemma length linear LNCS mass matching problem Max-SNP maximal median minimal consensus PQ mismatches motif multiset node O(n log obtained occurrences optimal output p₁ pair Parsing path pattern matching peak permutations polynomial position PQ tree prefix prefix-free preprocessing Proc Proof protein regular expression rigid subsequence S₁ score Section shift distance space spin images Springer-Verlag string matching substring suffix array suffix tree term tree Theorem trie variable vector vertex WDWG words