Pages that link to "Item:Q5393947"
From MaRDI portal
The following pages link to String Processing and Information Retrieval (Q5393947):
Displaying 9 items.
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- Linear time algorithms for generalizations of the longest common substring problem (Q547294) (← links)
- Finding the longest common nonsuperstring in linear time (Q989576) (← links)
- Longest segment problems (Q1190849) (← links)
- On finding a longest common palindromic subsequence (Q1698702) (← links)
- Linear time algorithm for the longest common repeat problem (Q2457296) (← links)
- Longest repeats with a block of \(k\) don't cares (Q2508981) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- LATIN 2004: Theoretical Informatics (Q5901647) (← links)