Pages that link to "Item:Q4987445"
From MaRDI portal
The following pages link to A Linear-Time Algorithm for Seeds Computation (Q4987445):
Displaying 21 items.
- Fast algorithm for partial covers in words (Q493243) (← links)
- Covering problems for partial words and for indeterminate strings (Q1676304) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- Computing regularities in strings: a survey (Q1761494) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Constructing antidictionaries of long texts in output-sensitive space (Q2048208) (← links)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance (Q2118198) (← links)
- Minimal unique palindromic substrings after single-character substitution (Q2146122) (← links)
- Experimental evaluation of algorithms for computing quasiperiods (Q2220855) (← links)
- On approximate enhanced covers under Hamming distance (Q2295626) (← links)
- Longest property-preserved common factor: a new string-processing framework (Q2297866) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Quasi-Periodicity in Streams (Q5088913) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- Computing the Antiperiod(s) of a String (Q5088925) (← links)
- Lazy Lempel-Ziv Factorization Algorithms (Q5266607) (← links)
- (Q5743460) (redirect page) (← links)
- Efficient Computation of 2-Covers of a String. (Q5874549) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- String Covering: A Survey (Q6145625) (← links)
