Titlebook: Combinatorial Pattern Matching; 8th Annual Symposium Alberto Apostolico,Jotun Hein Conference proceedings 1997 Springer-Verlag Berlin Heide

verdict

Approximation algorithms for the fixed-topology phylogenetic number problem,

opportune

FIS

能得到

Aligning coding DNA in the presence of frame-shift errors,

Abutment

Episode matching,de-off, i.e., it works in time . log log ./log(.)) when additional space is limited to .. Finally, we present two approximation algorithms for the optimization problem. The off-line algorithm is alphabet independent, it has superlinear time complexity .loglog(.)) and it uses only constant space. The

Entropion

On the complexity of pattern matching for highly compressed two-dimensional texts,compressed pattern-matching, where the input consists of hierarchical descriptions of both the pattern . and the text .. For 1-dimensional strings there exist polynomial-time deterministic algorithms for these problems, for similar types of succinct text descriptions [2, 6, 8, 9]. We show that the c

RECUR

Keratin

护航舰

shrill