Sciweavers

400 search results - page 15 / 80
» On some Properties of DNA Graphs
Sort
View
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
14 years 5 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
WWW
2010
ACM
14 years 2 months ago
Measurement-calibrated graph models for social network experiments
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
Alessandra Sala, Lili Cao, Christo Wilson, Robert ...
DM
2002
114views more  DM 2002»
13 years 7 months ago
C4-saturated bipartite graphs
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
Darryn E. Bryant, Hung-Lin Fu
ECAL
2005
Springer
14 years 1 months ago
The Genetic Coding Style of Digital Organisms
Recently, all the human genes were identified. But understanding the functions coded in the genes is of course a much harder problem. We are used to view DNA as some sort of a comp...
Philip Gerlee, Torbjörn Lundh
ICALP
1992
Springer
13 years 12 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao