122
Voted
CPM
15 years 7 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...
162
Voted
CPM
15 years 10 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...
195
click to vote
CPM
15 years 1 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...
128
Voted
CPM
15 years 10 months ago
2009 Springer 
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
|
Combinatorics