Pages that link to "Item:Q1063423"
From MaRDI portal
The following pages link to The smallest automaton recognizing the subwords of a text (Q1063423):
Displayed 50 items.
- Compressed directed acyclic word graph with application in local alignment (Q378207) (← links)
- On-line construction of position heaps (Q396632) (← links)
- On the structure of compacted subword graphs of Thue-Morse words and their applications (Q414440) (← links)
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- General suffix automaton construction algorithm and space bounds (Q840781) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- On Sturmian graphs (Q881581) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- A faster algorithm for matching a set of patterns with variable length don't cares (Q991757) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- A new distance metric on strings computable in linear time (Q1102764) (← links)
- La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time) (Q1115203) (← links)
- A variation on the Boyer-Moore algorithm (Q1190458) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- Data compression with factor automata (Q1190467) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- Normal forms of quasiperiodic strings (Q1583537) (← links)
- Words and forbidden factors (Q1605329) (← links)
- On-line construction of compact directed acyclic word graphs (Q1764897) (← links)
- Transducers and repetitions (Q1820587) (← links)
- Average sizes of suffix trees and DAWGs (Q1822940) (← links)
- A speed-up for the commute between subword trees and DAWGs. (Q1853059) (← links)
- Reducing space for index implementation. (Q1853739) (← links)
- Compact recognizers of episode sequences (Q1854526) (← links)
- On-line construction of suffix trees (Q1897476) (← links)
- Covering a string (Q1924404) (← links)
- Dynamic construction of an antidictionary with linear complexity (Q2437769) (← links)
- Motif patterns in 2D (Q2474071) (← links)
- Constructing suffix arrays in linear time (Q2569391) (← links)
- Indexing text with approximate \(q\)-grams (Q2569395) (← links)
- Searching subsequences (Q2638800) (← links)
- WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING (Q3016225) (← links)
- Forbidden Factors and Fragment Assembly (Q3147023) (← links)
- (Q3165665) (← links)
- (Q3165666) (← links)
- THE STRUCTURE OF FACTOR ORACLES (Q3503093) (← links)
- On the Suffix Automaton with Mismatches (Q3503902) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM (Q3655531) (← links)
- A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences (Q4792964) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)