13 search results - page 1 / 3 » Randomness and Representation of Span n Sequences |
SSC
2007
Springer
13 years 11 months ago
2007
Springer
Any span n sequences can be regarded as filtering sequences. From this observation, new randomness criteria for span n sequences are proposed. It is proved that the feedback funct...
ISMB
1993
13 years 6 months ago
1993
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
CPC
2007
13 years 5 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...