Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 1996 - Combinatorial analysis |
From inside the book
Results 1-3 of 57
Page 66
... denote the length of w , w [ i ] denote the i - th symbol of w and wh denote w reversed . The strings in the dictionary W are called dictionary strings . We let dist ( u , v ) denote the Hamming distance between the two strings u and v ...
... denote the length of w , w [ i ] denote the i - th symbol of w and wh denote w reversed . The strings in the dictionary W are called dictionary strings . We let dist ( u , v ) denote the Hamming distance between the two strings u and v ...
Page 88
... denote the length of string si , S❘ to denote the sum of the lengths of all the strings , and opt ( S ) to denote the length of the shortest superstring of S. Given two strings s and t , we define ov ( s , t ) , the overlap between s ...
... denote the length of string si , S❘ to denote the sum of the lengths of all the strings , and opt ( S ) to denote the length of the shortest superstring of S. Given two strings s and t , we define ov ( s , t ) , the overlap between s ...
Page 172
... Denote i ~ j if | ij | 1. Extend a permutation ( 1 ... n ) by adding To = 0 and An + 1 = n + 1. We call a pair of consecutive elements ; and Ti + 1 , 0 ≤ i ≤ n , of π a breakpoint if π ; † πi + 1 and an adjacency if π ; ~ ; +1 . The ...
... Denote i ~ j if | ij | 1. Extend a permutation ( 1 ... n ) by adding To = 0 and An + 1 = n + 1. We call a pair of consecutive elements ; and Ti + 1 , 0 ≤ i ≤ n , of π a breakpoint if π ; † πi + 1 and an adjacency if π ; ~ ; +1 . The ...
Contents
A Faster Algorithm for Approximate String Matching | 1 |
BoyerMoore Strategy to Efficient Approximate String Matching | 24 |
Computing Discoveries in Molecular Biology Abstract | 64 |
Copyright | |
16 other sections not shown
Other editions - View all
Common terms and phrases
2-paths alphabet approximate string matching approximation algorithm automaton binary bound characters combinatorial complexity Computer Science connected components consider construction contains corresponding cost CS-tree cycle cycle graph data structure defined degree-2 edit denote dictionary directed graph edges edit distance efficient error Euler path evolutionary trees exons filtration genes genome given hash functions hash table hinge input integer l-sets label lattice Lemma length ligand linear matching problem maximum independent set median tree method minimum mismatches models molecular molecule node NP-complete NP-hard O(log O(nm occurrences optimal pair partition pattern matching permutation phyloDAG phylogeny phylograph polynomial position prefix preprocessing Proof protein protein folding q-gram query random receptor represented s-block S-labelled trees sequence solution space species spliced alignment step subgraph substring subtree suffix tree superstring symbols synteny target template algorithm Theorem trie vertex vertices weight word suffix tree