Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 1996 - Combinatorial analysis |
From inside the book
Results 1-3 of 80
Page 221
... sequences ( DNA , RNA or amino acid ) written at the leaves of the tree . Thus in biological applications , the tree is almost al- ways binary . The leaf sequences are ones found in organisms existing today . The sequences to be ...
... sequences ( DNA , RNA or amino acid ) written at the leaves of the tree . Thus in biological applications , the tree is almost al- ways binary . The leaf sequences are ones found in organisms existing today . The sequences to be ...
Page 233
... sequence alignment with guaranteed error bounds , Bulletin of Mathematical Biology 55 , pp . 141-154 , 1993 . 5. J. J. Hein , A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous ...
... sequence alignment with guaranteed error bounds , Bulletin of Mathematical Biology 55 , pp . 141-154 , 1993 . 5. J. J. Hein , A new method that simultaneously aligns and reconstructs ancestral sequences for any number of homologous ...
Page 390
... sequences . A single colored substring can be a highlighted motif of a protein family , particular DNA or RNA substrings of like function , or a molecular bind- ing site , while a gene's exons can be represented as a single colored ...
... sequences . A single colored substring can be a highlighted motif of a protein family , particular DNA or RNA substrings of like function , or a molecular bind- ing site , while a gene's exons can be represented as a single colored ...
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 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