Titlebook: Combinatorial Pattern Matching; Fifth Annual Symposi Maxime Crochemore,Dan Gusfield Conference proceedings 1994 Springer-Verlag Berlin Heid

雄辩

An alphabet-independent optimal parallel search for three dimensional pattern,imensional pattern P of shape .×.×. in a text T of shape .×.×. are to be found. Our algorithm works in log . time with .(./log(.)) processors of a ., where .=... The searching phase in three dimensions explores classification of two-dimensional periodicities of the cubic pattern. Some new projection

sinoatrial-node

Unit route upper bound for string-matching on hypercube,th a constant number of operations by communication. This algorithm is very close to the lower bound of the problem for this architecture. It uses 2. processors and it is based on combinatorial properties on the hypercube network such as the constant time shift of line for a length power of two and

CARE

Foreshadow

Neutral-Spine

Maximal common subsequences and minimal common supersequences,ynomial time for two strings (in fact the problems are dual in this case), or for any fixed number of strings, by dynamic programming. But both problems are NP-hard in general for an arbitrary number . of strings. Here we study the related problems of finding a minimum-length maximal common subseque

雄伟

Dictionary-matching on unbounded alphabets: Uniform length dictionaries,lization of this problem where one is looking simultaneously for all occurrences of several patterns in a single text..This paper presents an efficient on-line dictionary-matching algorithm for the case where the patterns have uniform length and the input alphabet is unbounded. A tight lower bound e

小故事

FAST

Ruptured-Disk

Arthropathy