Pages that link to "Item:Q1063423"
From MaRDI portal
The following pages link to The smallest automaton recognizing the subwords of a text (Q1063423):
Displaying 29 items.
- Searching subsequences (Q2638800) (← links)
- Parameterized DAWGs: efficient constructions and bidirectional pattern searches (Q2676460) (← links)
- The parameterized suffix tray (Q2692728) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING (Q3016225) (← links)
- Forbidden Factors and Fragment Assembly (Q3147023) (← links)
- (Q3165665) (← links)
- (Q3165666) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← 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)
- Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)
- On the Structure of Consistent Partitions of Substring Set of a Word (Q5321725) (← links)
- Multi-pattern matching algorithm with wildcards based on bit-parallelism (Q5371909) (← links)
- THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY (Q5462113) (← links)
- FORMAL MODELLING OF VIRAL GENE COMPRESSION (Q5462117) (← links)
- COMBINATORIAL CHARACTERIZATION OF THE LANGUAGE RECOGNIZED BY FACTOR AND SUFFIX ORACLES (Q5714666) (← links)
- The palindromization map (Q6048431) (← links)
- Nearly \(k\)-universal words -- investigating a part of Simon's congruence (Q6073651) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
- Linear-time computation of generalized minimal absent words for multiple strings (Q6545442) (← links)
- Linear time online algorithms for constructing linear-size suffix trie (Q6614010) (← links)
- Linear-size suffix tries and linear-size CDAWGs simplified and improved (Q6634511) (← links)
