Pages that link to "Item:Q1426464"
From MaRDI portal
The following pages link to On the complexity of finding common approximate substrings. (Q1426464):
Displaying 6 items.
- An improved voting algorithm for planted \((l, d)\) motif search (Q497197) (← links)
- Hard problems in similarity searching (Q1885825) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- Finding Consensus Strings with Small Length Difference Between Input and Solution Strings (Q2946423) (← links)
- (Q5005095) (← links)
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
