Výsledky vyhľadávania - combinatorial algorithms on words

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

Získať plný text

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

“…  T. Currently, the fastest algorithms for this problem are the following. The Galil–Giancarlo algorithm finds all locations where the pattern has at most k errors…”
Získať plný text

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

“… ) time, respectively, where K is the number of maximal substrings. In this paper, we propose two improved algorithms for the text fingerprinting indexing problem…”
Získať plný text

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

“… Finding a combinatorial definition that captures the concept of real scaling in discrete images has been a challenge in the pattern matching field…”
Získať 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ískať 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ískať 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…”
Zistit podrobnosti o prístupe

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

“…′ of P with an exact matching of P′ in location i of T. Recently, some efficient algorithms were developed for this problem…”
Získať 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ískať 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ískať plný text

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

“… In this paper we show the first algorithm that solves the pattern matching with swaps problem in time o(nm…”
Získať 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ískať plný text

Search Algorithms for the Combinatorial Generation of Bordered Box Repetition-Free Words Autor Grobler, Trienko, Habeck, Manfred, van Zijl, Lynette, Geldenhuys, Jaco

“…Four search algorithms to search for the longest box repetition-free word over a given alphabet are presented, giving an empirical result on the upper bound of the length of these words…”
Získať plný text

Shifted insertion algorithms for primed words Autor Marberg, Eric

Získať plný text

Standard Sturmian words and automata minimization algorithms Autor Castiglione, G., Sciortino, M.

“…The study of some close connections between the combinatorial properties of words and the performance of the automata minimization process constitutes the main focus of this paper…”
Získať plný text

Circular sturmian words and Hopcroft’s algorithm Autor Castiglione, G., Restivo, A., Sciortino, M.

“…In order to analyze some extremal cases of Hopcroft’s algorithm, we investigate the relationships between the combinatorial properties of a circular sturmian word ( x…”
Získať plný text

Combinatorial Optimization of Physics Parameterization Schemes for Typhoon Simulation Based on a Simple Genetic Algorithm (SGA) Autor Lu, Zebin, Xu, Jianjun, Chen, Zhiqiang, Yang, Jinyi, Leung, Jeremy Cheuk-Hin, Xu, Daosheng, Zhang, Banglin

“… This study applied a simple genetic algorithm (SGA) to optimizing the combination of parameterization schemes in NWP models for typhoon forecasting…”
Získať plný text

Efficient generation of restricted growth words Autor Mansour, Toufik, Vajnovszki, Vincent

“… Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences…”
Získať plný text

A self-adaptive mechanism using weibull probability distribution to improve metaheuristic algorithms to solve combinatorial optimization problems in dynamic environments Autor J. Montiel Moctezuma, Cesar, Mora, Jaime, González Mendoza, Miguel

“… good alternative to improve performance in these algorithms. On this research, the performance of a genetic algorithm is improved through a self-adaptive mechanism to solve dynamic combinatorial problems…”
Získať plný text

Perforated Tableaux: A Combinatorial Model for Crystal Graphs in Type An− 1 Autor Appleby, Glenn D., Whitehead, Tamsen

“…We present a combinatorial model, called perforated tableaux , to study A n − 1 crystals, unifying several previously studied combinatorial models…”
Získať plný text