Filters

226 Hits in 3.8 sec

### New algorithms for binary jumbled pattern matching

Emanuele Giaquinta, Szymon Grabowski
2013 Information Processing Letters
Given a pattern P and a text T, both strings over a binary alphabet, the binary jumbled string matching problem consists in telling whether any permutation of P occurs in T.  ...  The indexed version of this problem, i.e., preprocessing a string to efficiently answer such permutation queries, is hard and has been studied in the last few years.  ...  The task of jumbled string matching [3] , in its decision version, consists in telling if any permutation of a pattern P occurs in a text T , both strings over a finite alphabet.  ...

### Binary Jumbled Pattern Matching on Trees and Tree-Like Structures [article]

Travis Gagie and Danny Hermelin and Gad M. Landau and Oren Weimann
2014 arXiv   pre-print
Binary jumbled pattern matching asks to preprocess a binary string S in order to answer queries (i,j) which ask for a substring of S that is of length i and has exactly j 1-bits.  ...  In this paper, we give an O(n^2 / ^2 n)-time solution for trees, matching the currently best bound for (the simpler problem of) strings.  ...  Given a binary string of length n, Cicalese, Fici and Lipták [14] showed how one can build in O(n 2 ) time an O(n)-space index that answers jumbled pattern matching queries in O(1) time.  ...

### Binary Jumbled Pattern Matching on Trees and Tree-Like Structures

Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2014 Algorithmica
Given a binary string of length n, Cicalese, Fici and Lipták [14] showed how one can build in O(n 2 ) time an O(n)-space index that answers jumbled pattern matching queries in O(1) time.  ...  Binary jumbled pattern matching asks to preprocess a binary string S in order to answer queries (i, j) which ask for a substring of S that is of length i and has exactly j 1-bits.  ...  This matches the performance of the best known index for binary strings.  ...

### Binary Jumbled Pattern Matching on Trees and Tree-Like Structures [chapter]

Travis Gagie, Danny Hermelin, Gad M. Landau, Oren Weimann
2013 Lecture Notes in Computer Science
Given a binary string of length n, Cicalese, Fici and Lipták [14] showed how one can build in O(n 2 ) time an O(n)-space index that answers jumbled pattern matching queries in O(1) time.  ...  Binary jumbled pattern matching asks to preprocess a binary string S in order to answer queries (i, j) which ask for a substring of S that is of length i and has exactly j 1-bits.  ...  This matches the performance of the best known index for binary strings.  ...

### Improved online algorithms for jumbled matching

Sukhpal Singh Ghuman, Jorma Tarhio, Tamanna Chhabra
2018 Discrete Applied Mathematics
Indexing a string for jumbled matching is more difficult to solve than in other variations of string matching. The indexing problem is more challenging than the jumbled matching itself. Moosa et al.  ...  Indexing The task of indexing for jumbled matching addresses the problem of indexing a string T over an alphabet Σ for a given pattern P , and to find all substrings of S that are permutations of P .  ...

### String Factorizations Under Various Collision Constraints

Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer, Oren Weimann, Inge Li Gørtz
2020 Annual Symposium on Combinatorial Pattern Matching
In the NP-hard Equality-Free String Factorization problem, we are given a string S and ask whether S can be partitioned into k factors that are pairwise distinct.  ...  This formulation improves over a previous one for Equality-Free String Factorization in terms of the number of variables.  ...  This notion of equivalence is used in Jumbled Pattern Matching [6] . Since = Σ and = Σ,# are equivalence relations, Theorem 1.1 directly implies an FPT algorithm for them.  ...

### Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction [article]

Ramtin Afshar, Amihood Amir, Michael T. Goodrich, Pedro Matias
2020 arXiv   pre-print
We study the query complexity of exactly reconstructing a string from adaptive queries, such as substring, subsequence, and jumbled-index queries.  ...  Finally, we believe we are the first to study the exact-learning query complexity for string reconstruction using jumbled-index queries, which are a "mixed-up" typeA of query that have received much attention  ...  Acknowledgments This research was funded in part by the U.S. National Science Foundation under grant 1815073. Amihood Amir was partly supported by BSF grant 2018141 and ISF grant 1475-18.  ...

### On prefix normal words and prefix normal forms

Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
2017 Theoretical Computer Science
These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of 1s and 0s (a given Parikh vector).  ...  Each binary word has an associated set of Parikh vectors of the factors of the word.  ...  Indexing for binary jumbled pattern matching Theorem 4 is relevant for the problem known as Indexed Binary Jumbled Pattern Matching, which has attracted much interest recently.  ...

### Orthogonal Range Searching for Text Indexing [article]

Moshe Lewenstein
2013 arXiv   pre-print
In the last few years we have seen an increase in use of this method and are reaching a deeper understanding of the range searching uses for text indexing.  ...  Text indexing, the problem in which one desires to preprocess a (usually large) text for future (shorter) queries, has been researched ever since the suffix tree was invented in the early 70's.  ...  Special thanks to Orgad, Rahul, Sharma and Yakov for numerous Skype conversations in which I learned more than can be contained within this monologue.  ...

### Data Structure Lower Bounds for Document Indexing Problems [article]

Peyman Afshani, Jesper Sindahl Nielsen
2016 arXiv   pre-print
Often our lower bounds match the known space-query time trade-off curve and in fact for all the problems considered, there is a very good and reasonable match between the our lower bounds and the known  ...  We study data structure problems related to document indexing and pattern matching queries and our main contribution is to show that the pointer machine model of computation can be extremely useful in  ...  ., binary strings).  ...

### Foundations of computer science

1978 Information Processing Letters
Binary search trees are an important application of binary trees. They work for keys that have a total ordering, such as strings.  ...  . . . explode(s) list of the characters in string s implode(l) string made of the characters in list l size(s) number of chars in string s s 1ˆs2 concatenation of strings s 1 and s 2 find x in list [  ...  Our representation allows addition, multiplication and division to be performed using the classical algorithms taught in schools. Their efficiency can sometimes be improved upon.  ...

### Letter order is not coded by open bigrams

Sachiko Kinoshita, Dennis Norris
2013 Journal of Memory and Language
We report three experiments using bigram primes in the same-different match task, investigating the effects of order reversal and the number of letters intervening between the letters in the target.  ...  ., SERIOL: Whitney, 2001 Binary OB, Grainger & van Heuven, 2003; Overlap OB, Grainger et al., 2006; Local combination detector model, Dehaene et al., 2005) posit that letter order in a word is coded by  ...  The main means of generating predictions from the OB models concerning priming is to compute ''match scores'', which index the orthographic similarity between two letter strings based on the number of  ...

### BINARY MINOR PLANETS

Derek C. Richardson, Kevin J. Walsh
2006 Annual Review of Earth and Planetary Science
Numerical simulations have successfully reproduced key features of the binaries in the first two categories; the third remains to be investigated in detail. 47 Annu. Rev. Earth Planet.  ...  A review of observations and theories regarding binary asteroids and binary trans-Neptunian objects [collectively, binary minor planets (BMPs)] is presented.  ...  Larger D s /D p binaries evolve much faster, but are limited by the total amount of angular momentum available in the primary's rotation for expanding the orbit.  ...

### Annual review of earth and planetary sciences

1983 Computers & Geosciences
Numerical simulations have successfully reproduced key features of the binaries in the first two categories; the third remains to be investigated in detail. 47 Annu. Rev. Earth Planet.  ...  A review of observations and theories regarding binary asteroids and binary trans-Neptunian objects [collectively, binary minor planets (BMPs)] is presented.  ...  Larger D s /D p binaries evolve much faster, but are limited by the total amount of angular momentum available in the primary's rotation for expanding the orbit.  ...

### Identification of kinetics of direct esterification reactions for PET synthesis based on a genetic algorithm

Ju-Youl Kim, Hee-Young Kim, Yeong-Koo Yeo
2001 Korean Journal of Chemical Engineering
In this study we propose a method to identify the kinetics of direction esterification reactions for polyethylene terephthalate (PET) based on a genetic algorithm.  ...  It was observed that the reactor performance strongly depends on the degree of dissolution of the solid terephthalic acid (TPA) in the reaction mixtures.  ...  However, because the promotion of forward reactions in esterification by more dissolved TPA is less than that of reverse reactions, all indexes about reaction efficiency decrease with increasing pressure  ...
« Previous Showing results 1 — 15 out of 226 results