Sciweavers

2487 search results - page 286 / 498
» Partitions of Graphs into Trees
Sort
View
138
Voted
JCB
2008
81views more  JCB 2008»
15 years 3 months ago
Estimating the Ancestral Recombinations Graph (ARG) as Compatible Networks of SNP Patterns
Traditionally nonrecombinant genome, i.e., mtDNA or Y chromosome, has been used for phylogeography, notably for ease of analysis. The topology of the phylogeny structure in this c...
Laxmi Parida, Marta Melé, Francesc Calafell...
133
Voted
EJC
2002
15 years 3 months ago
On the Natural Imprint Function of a Graph
A subgraph H of a graph G is gated if for every x V(G) there exists a vertex u in H such that dG (x, v) = dG (x, u) + d G (u, v) for any v V(H). The gated amalgam of graphs G 1 an...
Bostjan Bresar
103
Voted
ENTCS
2011
56views more  ENTCS 2011»
14 years 10 months ago
Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract)
d abstract) Andr´e Joyal 1 D´epartement des math´ematiques Universit´e du Qu´ebec `a Montr´eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...
André Joyal, Joachim Kock
ICML
2003
IEEE
16 years 4 months ago
Marginalized Kernels Between Labeled Graphs
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Hisashi Kashima, Koji Tsuda, Akihiro Inokuchi
122
Voted
COCOON
2009
Springer
15 years 10 months ago
Computing Bond Types in Molecule Graphs
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...
Sebastian Böcker, Quang Bao Anh Bui, Patrick ...