Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 34
Page 23
... edit O ( m log n log log n + occ ) O ( n log n ) 1 edit O ( m log log n + occ ) O ( nlogn ) 1 Ham . O ( m + occ ) Table 1. Previous work on text ... edit operations an ordered edit sequence if the operations. Text Indexing with Errors 23.
... edit O ( m log n log log n + occ ) O ( n log n ) 1 edit O ( m log log n + occ ) O ( nlogn ) 1 Ham . O ( m + occ ) Table 1. Previous work on text ... edit operations an ordered edit sequence if the operations. Text Indexing with Errors 23.
Page 334
... edit distance and alignment . The original edit distance is based on three edit operations on nodes insertion , deletion and substitution- and operations can apply without any restriction in any order . Tai [ 10 ] introduced a first ...
... edit distance and alignment . The original edit distance is based on three edit operations on nodes insertion , deletion and substitution- and operations can apply without any restriction in any order . Tai [ 10 ] introduced a first ...
Page 335
... Edit distance versus alignment 1 ( borrowed from [ 7 ] ) . The first picture shows the optimal mapping for the two trees A and B with the edit distance : the mapping contains a deletion and an insertion . That makes two errors . With ...
... Edit distance versus alignment 1 ( borrowed from [ 7 ] ) . The first picture shows the optimal mapping for the two trees A and B with the edit distance : the mapping contains a deletion and an insertion . That makes two errors . With ...
Contents
Sharper Upper and Lower Bounds for an Approximation Scheme | 1 |
Text Indexing with Errors | 21 |
Succinct Suffix Arrays Based on RunLength Encoding | 45 |
Copyright | |
20 other sections not shown
Other editions - View all
Common terms and phrases
algorithm alignment alphabet Apostolico approximate automaton Bioinformatics bits bound breakpoint Burrows-Wheeler transform c-token character column complexity Computer Science consensus PQ tree consider constraints construction Corasick corresponding Crochemore data structure defined Definition denote DFTDP DIST DNA sequences dynamic programming edges edit distance efficient encoding errors example exons function gene genome given graph Hamming distance implementation input integer interval label Lemma length linear LNCS mass matching problem Max-SNP maximal median minimal consensus PQ mismatches motif multiset node O(n log obtained occurrences optimal output p₁ pair Parsing path pattern matching peak permutations polynomial position PQ tree prefix prefix-free preprocessing Proc Proof protein regular expression rigid subsequence S₁ score Section shift distance space spin images Springer-Verlag string matching substring suffix array suffix tree term tree Theorem trie variable vector vertex WDWG words