6943 search results - page 273 / 1389 » Representations for evolutionary algorithms |
105
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
126
click to vote
AAECC
2002
Springer
15 years 4 months ago
2002
Springer
Let Fq be the finite field of order q and be an element of Fq of order d. The construction of an explicit polynomial f (X) Fq[X] of degree d - 1 with the property f i = i2 for ...
136
click to vote
ISMB
1997
15 years 6 months ago
1997
The structural comparison of proteins has become increasingly important as a means to identify protein motifs and fold families. In this paper we present a new algorithm for the c...
136
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...
172
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...