96
Voted
CPM
15 years 4 months ago
2009 Springer 
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
131
Voted
CPM
15 years 7 months ago
2009 Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
147
Voted
CPM
14 years 10 months ago
2009 Springer 
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
182
Voted
COCOON
14 years 10 months ago
2009 Springer 
Given a sequencing of jobs on a single machine, each one with a weight, processing time, and a due date, the tardiness of a job is the time needed for its completion beyond its du...
|
Combinatorics