2004 search results - page 34 / 401 » Sampling from large graphs |
111
click to vote
CIKM
2010
Springer
14 years 10 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
103
click to vote
BMCBI
2010
14 years 12 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
GG
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Graph constraints and application conditions are most important for graph grammars and transformation systems in a large variety of application areas. Although different...
121
click to vote
NAR
2010
14 years 6 months ago
2010
Alternative splicing is an important mechanism for increasing protein diversity. However, its functional effects are largely unknown. Here, we present our new software workflow co...