Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2003 - Combinatorial analysis |
From inside the book
Results 1-3 of 85
Page 278
... sequences of the set . By considering structural information only , the algorithm can be applied to cases where the input sequences do not present any significant similarity . However , sequence information can be added to the algorithm ...
... sequences of the set . By considering structural information only , the algorithm can be applied to cases where the input sequences do not present any significant similarity . However , sequence information can be added to the algorithm ...
Page 293
... sequences only , by predicting structural elements while searching for sequence motifs sharing the same patterns of base pairs . Perhaps the more encouraging results came from this idea , that we are now validating with other real ...
... sequences only , by predicting structural elements while searching for sequence motifs sharing the same patterns of base pairs . Perhaps the more encouraging results came from this idea , that we are now validating with other real ...
Page 385
... sequences . As of September 2002 , the number of sequences deposited in NCBI's dbEST [ 2 ] has reached 13 million sequences out of the 18 million sequences which composes the entire GenBank . With the advent of whole genome sequencing ...
... sequences . As of September 2002 , the number of sequences deposited in NCBI's dbEST [ 2 ] has reached 13 million sequences out of the 18 million sequences which composes the entire GenBank . With the advent of whole genome sequencing ...
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