Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 38
Page 41
... extended lcp array when || = 16 . 1 : 2 : 3 : 4 : 5 : 6 : 7 : 8 : 9 : 10 : Procedure EXTLCP ranking [ 1..n 1 ] = 1 ; -- numchild [ 1..n - 1 ] = 0 ; push ( 1 ) ; for i = 2 to n do : = while 1cp [ i ] < 1cp [ top ( ) ] do lastIndex = pop ...
... extended lcp array when || = 16 . 1 : 2 : 3 : 4 : 5 : 6 : 7 : 8 : 9 : 10 : Procedure EXTLCP ranking [ 1..n 1 ] = 1 ; -- numchild [ 1..n - 1 ] = 0 ; push ( 1 ) ; for i = 2 to n do : = while 1cp [ i ] < 1cp [ top ( ) ] do lastIndex = pop ...
Page 129
... extended the previous model of [ 14 ] by repre- senting genomes as sequences rather then permutations , and devised a ( n2 ) algorithm for extracting all common intervals of two sequences . He and Gold- wasser [ 13 ] extended the notion ...
... extended the previous model of [ 14 ] by repre- senting genomes as sequences rather then permutations , and devised a ( n2 ) algorithm for extracting all common intervals of two sequences . He and Gold- wasser [ 13 ] extended the notion ...
Page 358
... extend them to the co - occurrence problem . We point out that these criteria values depend on a few fundamental ... extended model of consensus . 1 Introduction Many statistical softwares have been designed in the last decade to ...
... extend them to the co - occurrence problem . We point out that these criteria values depend on a few fundamental ... extended model of consensus . 1 Introduction Many statistical softwares have been designed in the last decade to ...
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