Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2003 - Combinatorial analysis |
From inside the book
Results 1-3 of 64
Page 159
... elements , by replacing each element i by two elements 2i — 1 , 2i . On the doubled permutation f ( T ) , we allow only transpositions that cut before odd positions . This ensures that no transposition cuts between 2i 1 and 2i , and ...
... elements , by replacing each element i by two elements 2i — 1 , 2i . On the doubled permutation f ( T ) , we allow only transpositions that cut before odd positions . This ensures that no transposition cuts between 2i 1 and 2i , and ...
Page 180
... elements in it have opposite signs . That way , we can reverse a block simply by flipping its reversed flag . We maintain the blocks in a list , where each block points to a list of the items it contains ( and also stores its size ) and ...
... elements in it have opposite signs . That way , we can reverse a block simply by flipping its reversed flag . We maintain the blocks in a list , where each block points to a list of the items it contains ( and also stores its size ) and ...
Page 380
... elements x , y and z such that x < y < z in one of the sequences R2 from R , 0 ≤ i ≤ L −1 , and such that [ x y z ] is a subsequence of Ri , then there is a triple ( x ' , y ' , z ' ) in R , such that [ x'y'z ' ] is a subsequence of ...
... elements x , y and z such that x < y < z in one of the sequences R2 from R , 0 ≤ i ≤ L −1 , and such that [ x y z ] is a subsequence of Ri , then there is a triple ( x ' , y ' , z ' ) in R , such that [ x'y'z ' ] is a subsequence of ...
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