Detecting One-Variable Patterns
From MaRDI portal
Publication:5150937
DOI10.1007/978-3-319-67428-5_22zbMath1454.68205arXiv1604.00054OpenAlexW2741656747MaRDI QIDQ5150937
Dmitry Kosolobov, Dirk Nowotka, Florin Manea
Publication date: 16 February 2021
Published in: String Processing and Information Retrieval (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.00054
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Extracting powers and periods in a word from its runs structure
- Finding a homomorphism between two words is NP-complete
- Finding patterns common to a set of strings
- EERTREE: an efficient data structure for processing palindromes in strings
- Generalized function matching
- Characterising REGEX languages by regular languages equipped with factor-referencing
- Revisiting Shinohara's algorithm for computing descriptive patterns
- Weighted Ancestors in Suffix Trees
- Generalised Lyndon-Schützenberger Equations
- Online Detection of Repetitions with Backtracking
- Testing Generalised Freeness of Words
- Linear work suffix array construction
- A Minimal Periods Algorithm with Applications
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- A Linear-Time On-Line Recognition Algorithm for ``Palstar
- Jewels of Stringology
- Pal k is Linear Recognizable Online
- The “Runs” Theorem
- Internal Pattern Matching Queries in a Text and Applications
This page was built for publication: Detecting One-Variable Patterns
