Výsledky vyhledávání - "combinatorial algorithms on words"

Approximate Pattern Matching with the L 1, L 2 and L ∞ Metrics Autor Lipsky, Ohad, Porat, Ely

Získat plný text

Faster algorithms for string matching with k mismatches Autor Amir, Amihood, Lewenstein, Moshe, Porat, Ely

“…The string matching with mismatches problem is that of finding the number of mismatches between a pattern P of length m and every length m substring of the…”
Získat plný text

Faster query algorithms for the text fingerprinting problem Autor Chan, Chi-Yuan, Yu, Hung-I, Hon, Wing-Kai, Wang, Biing-Feng

“…Let S be a string over a finite, ordered alphabet Σ. For any substring S ′ of S, the set of distinct characters contained in S ′ is called its fingerprint. The…”
Získat plný text

Overlap matching Autor Amir, Amihood, Cole, Richard, Hariharan, Ramesh, Lewenstein, Moshe, Porat, Ely

“…We propose a new paradigm for string matching, namely structural matching. In structural matching, the text and pattern contents are not important. Rather,…”
Získat plný text

Real Two Dimensional Scaled Matching Autor Amir, Amihood, Butman, Ayelet, Lewenstein, Moshe, Porat, Ely

“…Scaled Matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary real-sized…”
Získat plný text

Character sets of strings Autor Didier, Gilles, Schmidt, Thomas, Stoye, Jens, Tsur, Dekel

“…Given a string S over a finite alphabet Σ, the character set (also called the fingerprint) of a substring S ′ of S is the subset C ⊆ Σ of the symbols occurring…”
Získat plný text

Permutation pattern discovery in biosequences Autor Eres, Revital, Landau, Gad M, Parida, Laxmi

“…Functionally related genes often appear in each other's neighborhood on the genome; however, the order of the genes may not be the same. These groups or…”
Zjistit podrobnosti o přístupu

Approximate swapped matching Autor Amir, Amihood, Lewenstein, Moshe, Porat, Ely

“…Let a text string T of n symbols and a pattern string P of m symbols from alphabet Σ be given. A swapped version P′ of P is a length m string derived from P by…”
Získat plný text

Pattern Matching with Swaps Autor Amir, Amihood, Aumann, Yonatan, Landau, Gad M., Lewenstein, Moshe, Lewenstein, Noa

“…Let a text string T of n symbols and a pattern string P of m symbols from alphabet Σ be given. A swapped version T′ of T is a length n string derived from T by…”
Získat plný text

Efficient special cases of Pattern Matching with Swaps Autor Amir, Amihood, Landau, Gad M., Lewenstein, Moshe, Lewenstein, Noa

“…Let a text string T of n symbols and a pattern string P of m symbols from alphabet ∑ be given. A swapped version T′ of T is a length n string derived from T by…”
Získat plný text

Real scaled matching Autor Amir, Amihood, Butman, Ayelet, Lewenstein, Moshe

“…Scaled matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary integral scale,…”
Získat plný text

Pattern Matching in Hypertext Autor Amir, Amihood, Lewenstein, Moshe, Lewenstein, Noa

“…The importance of hypertext has been steadily growing over the past decade. The Internet and other information systems use hypertext format, with data…”
Získat plný text