Combinatorial Pattern Matching: ... Annual SymposiumSpringer-Verlag, 2005 - Combinatorial analysis |
From inside the book
Results 1-3 of 58
Page 127
... Science , pages 388-399 . Springer- Verlag , 2004 . 3. M. Blanchette , G. Bourque , and D. Sankoff . Breakpoint phylogenies . In Proc . Genome Informatics Workshop , pages 25-34 . Univ . Academy Press , 1997 . 4. B. Bourque and P.A. ...
... Science , pages 388-399 . Springer- Verlag , 2004 . 3. M. Blanchette , G. Bourque , and D. Sankoff . Breakpoint phylogenies . In Proc . Genome Informatics Workshop , pages 25-34 . Univ . Academy Press , 1997 . 4. B. Bourque and P.A. ...
Page 287
... Science , 45 ( 1 ) : 63-86 , 1986 . 5. D. Gusfield . Algorithms on strings , trees , and sequences : computer science and computational biology . Cambridge University Press , 1997 . 6. S. Inenaga . Bidirectional construction of suffix ...
... Science , 45 ( 1 ) : 63-86 , 1986 . 5. D. Gusfield . Algorithms on strings , trees , and sequences : computer science and computational biology . Cambridge University Press , 1997 . 6. S. Inenaga . Bidirectional construction of suffix ...
Page 415
... Science , pages 238ā251 . Springer Verlag , 2001 . 6. Cosner , M.E. , R.K. Jansen , J.D. Palmer and S.R. Downie SR ( 1997 ) The highly rear- ranged chloroplast genome of Trachelium caeruleum ( Campanulaceae ) : multiple inversions ...
... Science , pages 238ā251 . Springer Verlag , 2001 . 6. Cosner , M.E. , R.K. Jansen , J.D. Palmer and S.R. Downie SR ( 1997 ) The highly rear- ranged chloroplast genome of Trachelium caeruleum ( Campanulaceae ) : multiple inversions ...
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