Periods in strings
From MaRDI portal
Publication:1154284
DOI10.1016/0097-3165(81)90038-8zbMath0464.68070OpenAlexW2005315460MaRDI QIDQ1154284
Leonidas J. Guibas, Andrew M. Odlyzko
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(81)90038-8
Related Items (58)
Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach ⋮ Local periods and binary partial words: an algorithm ⋮ On the distribution of characteristic parameters of words ⋮ A limit theorem on the number of overlapping appearances of a pattern in a sequence of independent trials ⋮ On pattern occurrences in a random text ⋮ Deviations from uniformity in random strings ⋮ A generating function approach to random subgraphs of the \(n\)-cycle ⋮ Saving comparisons in the Crochemore-Perrin string-matching algorithm ⋮ Testing primitivity on partial words ⋮ Asymptotics of Mahler recurrences: The cyclotomic case ⋮ Waiting times for clumps of patterns and for structured motifs in random sequences ⋮ String matching and 1d lattice gases ⋮ A new method of approximating the probability of matching common words in multiple random sequences ⋮ Border correlations, lattices, and the subgraph component polynomial ⋮ Border Correlations, Lattices, and the Subgraph Component Polynomial ⋮ 1-dependent stationary sequences for some given joint distributions of two consecutive random variables ⋮ Ranking and unranking bordered and unbordered words ⋮ Combinatorics on partial word borders ⋮ Entropy bounds for multi-word perturbations of subshifts ⋮ A NOTE ON FRACTALS OF ONE FORBIDDEN WORD AND THEIR BOX DIMENSIONS ⋮ First Occurrence in Pairs of Long Words: A Penney-ante Conjecture of Pevzner ⋮ String overlaps, pattern matching, and nontransitive games ⋮ String matching algorithms and automata ⋮ Zero-Order Markov Processes with Multiple Final Sequences of States ⋮ Combinatorics of periods in strings. ⋮ Unnamed Item ⋮ Algebraic methods for permutations with prescribed patterns ⋮ Two-pattern strings. II: Frequency of occurrence and substring complexity ⋮ On the Shortest Common Superstring of NGS Reads ⋮ Asymptotic number of isometric generalized Fibonacci cubes ⋮ Periods and binary words ⋮ Partial words and the critical factorization theorem revisited ⋮ Equations on partial words ⋮ Multiple pattern matching: a Markov chain approach ⋮ Periodicity properties on partial words ⋮ On cyclic strings avoiding a pattern ⋮ Two fast constructions of compact representations of binary words with given set of periods ⋮ Where to place a hole to achieve a maximal escape rate ⋮ Primitive partial words ⋮ On the accuracy of statistical procedures in Microsoft Excel 2010 ⋮ Linear-time computation of local periods ⋮ Partial words and the critical factorization theorem ⋮ Long repetitive patterns in random sequences ⋮ Combinatorics on partial word correlations ⋮ Unnamed Item ⋮ Testing randomness via aperiodic words ⋮ Content-based networks: A pedagogical overview ⋮ Gray code orders for \(q\)-ary words avoiding a given factor ⋮ On the shape of the fringe of various types of random trees ⋮ Periodicities on trees ⋮ Construction of the weight polynomial for autocorrelation of \(q\)-ary words ⋮ Gambling Teams and Waiting Times for Patterns in Two-State Markov Chains ⋮ On occurrence of subpattern and method of gambling teams ⋮ Fine and Wilf's theorem for three periods and a generalization of Sturmian words ⋮ An asymptotically optimal layout for the shuffle-exchange graph ⋮ Compound Poisson approximation of word counts in DNA sequences ⋮ Cross-monotone subsequences ⋮ The first return time test of pseudorandom numbers
Cites Work
- Unnamed Item
- The equation \(a_ M=b^ Nc^ P\) in a free group
- String overlaps, pattern matching, and nontransitive games
- A fast string searching algorithm
- Saving Space in Fast String-Matching
- A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
- Endliche 0-1-Folgen mit gleichen Teilblöcken.
- Fast Pattern Matching in Strings
- On the expected duration of a search for a fixed pattern in random data (Corresp.)
- Uniqueness Theorems for Periodic Functions
This page was built for publication: Periods in strings
