1215 search results - page 164 / 243 » Combinatorics |
120
click to vote
COCOON
2010
Springer
14 years 8 months ago
2010
Springer
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
120
click to vote
CPM
2009
Springer
14 years 7 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...
243
click to vote
COCOON
2011
Springer
13 years 9 months ago
2011
Springer
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we give a new algorithm to compute Liouvillian solutions of linear difference equations. Compared to the prior algorithm by Hendriks and Singer, our main contributi...
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
We provide three key missing pieces of a general theory of information distance [3, 23, 24]. We take bold steps in formulating a revised theory to avoid some pitfalls in practical...