Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2003 - Combinatorial analysis |
From inside the book
Results 1-3 of 53
Page 5
... points of the fragments are sorted w.r.t. their 1 coordinate . Then , processing the points in ascending order of their 1 coordinate simulates a line ( plane or hyper - plane in higher dimensions ) that sweeps the points w.r.t. their 1 ...
... points of the fragments are sorted w.r.t. their 1 coordinate . Then , processing the points in ascending order of their 1 coordinate simulates a line ( plane or hyper - plane in higher dimensions ) that sweeps the points w.r.t. their 1 ...
Page 12
... points p in the first quadrant of s satisfying Az Ar2 ( i.e. , s.x1p.x1 s.x2 - p.x2 ) , these are the points lying below or > 1 on the straight line x2 = 1 + ( s.x2 s.x1 ) ; see Fig . 5. The second octant 02 consists of all points q ...
... points p in the first quadrant of s satisfying Az Ar2 ( i.e. , s.x1p.x1 s.x2 - p.x2 ) , these are the points lying below or > 1 on the straight line x2 = 1 + ( s.x2 s.x1 ) ; see Fig . 5. The second octant 02 consists of all points q ...
Page 14
... points of the n fragments in ascending order w.r.t. their x1 coordinate and store them in the array points ; because we include the end point of the origin and the start point of the terminus , there are 2n + 2 points . for j = 1 to k ...
... points of the n fragments in ascending order w.r.t. their x1 coordinate and store them in the array points ; because we include the end point of the origin and the start point of the terminus , there are 2n + 2 points . for j = 1 to k ...
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