Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2003 - Combinatorial analysis |
From inside the book
Results 1-3 of 81
Page 229
... denote the second sub - graph which represents the comparison of Y with T. Let I denote the first row of G. Namely , I [ j ] = | LCST , B1 ] | , for j = 1 , ... , n . Let O denote the last row of G. Namely , O [ j ] = | LCS [ T , BY ] ...
... denote the second sub - graph which represents the comparison of Y with T. Let I denote the first row of G. Namely , I [ j ] = | LCST , B1 ] | , for j = 1 , ... , n . Let O denote the last row of G. Namely , O [ j ] = | LCS [ T , BY ] ...
Page 316
... denote by IN the set { 1,2 , ... , n } and for every finite set X we denote by #X the cardinality of X. Words . An alphabet is a non empty set of letters . In the sequel , always denotes an alphabet . A word over Σ is a finite sequence ...
... denote by IN the set { 1,2 , ... , n } and for every finite set X we denote by #X the cardinality of X. Words . An alphabet is a non empty set of letters . In the sequel , always denotes an alphabet . A word over Σ is a finite sequence ...
Page 388
... denote the length of the i - th sequence , 1 ≤ i ≤ k . We set ni , which represents the total size of the input ... denote by fr ( y ) the number of occurrences of y in x . fx ( y ) denotes the total number of occurrences of y in x1 ...
... denote the length of the i - th sequence , 1 ≤ i ≤ k . We set ni , which represents the total size of the input ... denote by fr ( y ) the number of occurrences of y in x . fx ( y ) denotes the total number of occurrences of y in x1 ...
Contents
Chaining Algorithms Revisited | 1 |
TwoDimensional Pattern Matching with Rotations | 17 |
An Improved Algorithm for Generalized Comparison of Minisatellites | 32 |
Copyright | |
20 other sections not shown
Other editions - View all
Common terms and phrases
algorithm alignment alphabet applied approximate automaton Baeza-Yates binary Biology black edges block characters column Combinatorial common substring complexity compression computational biology Computer Science consider construction corresponding cycle data compression data structure dataset defined deletion denote distance dynamic programming edit distance efficient elements encoding equivalence class fragments genome given graph haplotypes implementation input integer l-grams label Lemma length line segments linear LNCS maximal MEDIAN STRING method motif node NP-complete NP-hard nucleotides O(n² oligos optimal oriented reversal pair path pattern matching peptide permutation pixel popular oligos pos(m position prefix preprocessing primitive priority queue problem Proc Proof protein q-patterns query random running s₁ Section seeds sequence solution solved sorting space stem-loop string matching substring subtree suffix array suffix tree symbol Theorem transformation transposition tree inclusion V₂ vertex