Pages that link to "Item:Q688167"
From MaRDI portal
The following pages link to On the complexity of learning strings and sequences (Q688167):
Displaying 7 items.
- Consistent subsequences and supersequences (Q671514) (← links)
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences (Q673078) (← links)
- Shortest consistent superstrings computable in polynomial time (Q673640) (← links)
- Approximating shortest superstrings with constraints (Q1341729) (← links)
- A new graph model and algorithms for consistent superstring problems <sup /> (Q2955630) (← links)
- DNA sequencing and string learning (Q3445271) (← links)
- Approximating shortest superstrings with constraints (Q5060130) (← links)
