What people are saying - Write a review
We haven't found any reviews in the usual places.
Extracting Common Motifs under the Levenshtein Measure
Extracting Structured Motifs under the Levenshtein Measure
External Memory Strings Sorting
2 other sections not shown
Adebiyi algorithm for finding approximate keyword searching Bernoulli trials buckets chapter characters Chernoff bounds Colorsma common motifs extraction computation condensed D-neighborhood construction covering list CSSX data structure Definition deletions disk distinct sequences DNA sequences Edit distance efficient exact repeats expected number extend external memory External Memory Algorithms Extma extracting common motifs Figure FM(n genome given group table Hamming distance I/O bound I/O complexity implemented integers large node leaf lemma log|E long strings main memory maximal models maximal repeats maxseq minseq node-occurrence Note number of I/Os number of maximal number of occurrences number of seeds number of strings number of supermaximal parameterized parameters positions pow(e prefix procedure protein represented running Sagot SB-tree Set^lcp short approximate repeats small node solving sorting strings string of length Strings Sorting structured motifs sub-procedure subject string substring suffix trees supermaximal repeats theoretical total number upper bound values Vanet xerr