135 search results - page 7 / 27 » String Noninclusion Optimization Problems |
163
click to vote
FOCS
2005
IEEE
15 years 11 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
155
Voted
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...
126
Voted
IWANN
2005
Springer
15 years 11 months ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
157
click to vote
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
147
click to vote
COMBINATORICS
2004
15 years 5 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...