Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 1996 - Combinatorial analysis |
From inside the book
Results 1-3 of 47
Page 143
... genes ) , and those at 240 PAM ( 15 % similarity ) are useful ( 75 % cor- relation with the actual genes ) . The idea of a similarity - based approach to gene detection was first stated in [ GS93 ] . Indeed , the number of already known ...
... genes ) , and those at 240 PAM ( 15 % similarity ) are useful ( 75 % cor- relation with the actual genes ) . The idea of a similarity - based approach to gene detection was first stated in [ GS93 ] . Indeed , the number of already known ...
Page 159
... gene order or gene orientation information . Given synteny data from present - day species , can we infer the synteny sets of ancestor species ? How many chromosomes did these ancestors possess , and what genes were on each one ? We ...
... gene order or gene orientation information . Given synteny data from present - day species , can we infer the synteny sets of ancestor species ? How many chromosomes did these ancestors possess , and what genes were on each one ? We ...
Page 164
... gene . Then while there remain unassigned genes satisfying the MCC , if there is one that can be added to an ... gene to a pre - existing ancestral chromosome , or to a new chromo- some , according to which gene , and which assignment ...
... gene . Then while there remain unassigned genes satisfying the MCC , if there is one that can be added to an ... gene to a pre - existing ancestral chromosome , or to a new chromo- some , according to which gene , and which assignment ...
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